Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization

Block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular subblocks; each block can then be handled as a computational unit in order to increase data reuse in a hierarchical memory system. Also, the factorization method increases the degree of concurrency and reduces t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Parallel computing Jg. 29; H. 1; S. 135 - 159
Hauptverfasser:	Lee, Heejo, Kim, Jong, Hong, Sung Je, Lee, Sunggu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 2003
Schlagworte:	Block-oriented Cholesky factorization Directed acyclic graph Parallel sparse matrix factorization Task scheduling Task scheduling Directed acyclic graph Block-oriented Cholesky factorization Parallel sparse matrix factorization
ISSN:	0167-8191, 1872-7336
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!