首页   按字顺浏览 期刊浏览 卷期浏览 A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION

 

作者: M.V. PADMINI,   B.B. MADAN,   B.N. JAIN,  

 

期刊: Parallel Algorithms and Applications  (Taylor Available online 1999)
卷期: Volume 13, issue 3  

页码: 187-215

 

ISSN:1063-7192

 

年代: 1999

 

DOI:10.1080/10637199808947367

 

出版商: Taylor & Francis Group

 

关键词: Cholesky factorization;Linear array;Parallel solution;Sparse matrix

 

数据来源: Taylor

 

摘要:

Achieving efficiency in parallel sparse sub-matrix Cholesky factorization is known to be difficult. The relevance of the underlying architecture in obtaining good performance is demonstrated, by choosing the linear array. The linear array architecture is chosen to suit the data flow pattern inherent to sub-matrix Cholesky scheme. The linear array is synthesized on the reconfigurable transputer based PARAM (and the MEIKO CSN) machine. The data structure used is an array of linked lists. Results obtained indicate almost linear speed-up up to 64 processors though the tests were conducted for 128 processors This highlights the significance of the underlying architecture for an efficient parallel implementation.

 

点击下载:  PDF (697KB)



返 回