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...

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 29; no. 1; pp. 135 - 159
Main Authors:	Lee, Heejo, Kim, Jong, Hong, Sung Je, Lee, Sunggu
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2003
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!