loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Papers
Memory-Based Scheduling for a Parallel Multifrontal Solver
Santa Fe, New Mexico
April 26-April 30
ISBN: 0-7695-2132-0
Abdou Guermouche, École Normale Supérieure de Lyon
Jean-Yves L'Excellent, École Normale Supérieure de Lyon
The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This paper describes dynamic scheduling strategies that aim at reducing the memory usage of a parallel direct solver. Combined to static modifications of the tasks dependency graph, experiments show that such techniques have a good potential to improve the memory usage of a parallel multifrontal solver, MUMPS.
Index Terms:
Sparse matrices, multifrontal method, scheduling, memory
Citation:
Abdou Guermouche, Jean-Yves L'Excellent, "Memory-Based Scheduling for a Parallel Multifrontal Solver," ipdps, vol. 1, pp.71a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Papers, 2004
Usage of this product signifies your acceptance of the Terms of Use.