Title
Analysis of the solution phase of a parallel multifrontal approach
Abstract
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in many applications, they can be the bottleneck so it is crucial to implement them efficiently. In this work, we assume that the factors have been written on disk during the factorization phase, and we discuss the design of an efficient solution phase. We will look at the issues involved when we are solving the sparse systems on parallel computers and will consider in particular their solution in a limited memory environment when out-of-core working is required. Two different approaches are presented to read data from the disk, with a discussion on the advantages and the drawbacks of each. We present some experiments on realistic test problems using an out-of-core version of a sparse multifrontal code called MUltifrontal Massively Parallel Solver (MUMPS).
Year
DOI
Venue
2010
10.1016/j.parco.2009.06.001
Parallel Computing
Keywords
Field
DocType
multifrontal solver,multifrontal approach,sparse multifrontal code,out-of-core,sparse multifrontal factorization,out-of-core algorithms.,mumps,sparse direct factorization,sparse matrices,factorization phase,distributed memory computation,sparse linear algebra,multifrontal massively,parallel multifrontal approach,substitution phase,sparse system,direct methods,out-of-core version,efficient solution phase,performance,out-of-core working,direct method,parallel computer,out of core
Bottleneck,Computer science,Massively parallel,Sparse approximation,Parallel computing,Theoretical computer science,Out-of-core algorithm,Factorization,Solver
Journal
Volume
Issue
ISSN
36
1
Parallel Computing
Citations 
PageRank 
References 
0
0.34
8
Authors
4
Name
Order
Citations
PageRank
P. Amestoy111.92
I. S. Duff21575530.95
A. Guermouche300.34
Tz. Slavova400.34