Adapting a parallel sparse direct solver to architectures with clusters of SMPs

We consider the direct solution of general sparse linear systems baseds on a multifrontal method. The approach combines partial static scheduling of the task dependency graph during the symbolic factorization and distributed dynamic scheduling during the numerical factorization to balance the work a...

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 29; no. 11; pp. 1645 - 1668
Main Authors:	Amestoy, Patrick R, Duff, Iain S, Pralet, Stéphane, Vömel, Christof
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2003
Subjects:	Distributed memory algorithms Dynamic scheduling MUMPS Sparse linear systems Task scheduling Task scheduling Dynamic scheduling MUMPS Distributed memory algorithms Sparse linear systems
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!