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

Celý popis

Podrobná bibliografia

Vydané v:	Parallel computing Ročník 29; číslo 1; s. 135 - 159
Hlavní autori:	Lee, Heejo, Kim, Jong, Hong, Sung Je, Lee, Sunggu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 2003
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!