On using an hybrid MPI-thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3911 LNCS, Issue , 2006, Pages 1050-1057

  Hénon, Pascal ^a   Ramet, Pierre ^a   Roman, Jean ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; INFORMATION DISSEMINATION; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SUPERCOMPUTERS;

PARALLEL SPARSE DIRECT SOLVERS; RUN-TIME PERFORMANCES; SHARED MEMORY; SUPERCOMPUTER ARCHITECTURES;

COMPUTER PROGRAMMING;

EID: 33745779237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11752578_127     Document Type: Conference Paper

References (9)

1. Anshul Gupta, Mahesh Joshi, and V. Kumar. Wsmp: A high-performance shared- and distributed-memory parallel sparse linear equation solver. Report, University of Minnesota and IBM Thomas J. Watson Research Center, 2001.
2. P. Hénon, P. Ramet, and J. Roman. A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization. In Proceedings of EuroPAR'99, number 1685 in Lecture Notes in Computer Science, pages 1059-1067. Springer Verlag, September 1999.
3. P. Hénon, P. Ramet, and J. Roman. PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions. In Proceedings of Irregular'2000, number 1800 in Lecture Notes in Computer Science, pages 519-525. Springer Verlag, May 2000.
4. P. Hénon, P. Ramet, and J. Roman. PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems. Parallel Computing, 28(2):301-321, January 2002.
5. P. H́non, P. Ramet, and J. Roman. Efficient algorithms for direct resolution of large sparse system on clusters of SMP nodes. In SIAM Conference on Applied Linear Algebra, Williamsburg, Virginie, USA, July 2003.
6. M. Joshi, G. Karypis, V. Kumar, A. Gupta, and Gustavson F. PSPASES: Scalable Parallel Direct Solver Library for Sparse Symmetric Positive Definite Linear Systems. Technical report, University of Minnesota and IBM Thomas J. Watson Research Center, May 1999.
7. X. S. Li. Sparse Gaussian Elimination on High Performance Computers. PhD thesis, University of California at Berkeley, 1996.
8. F. Pellegrini, J. Roman, and P. Amestoy. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience, 12:69-84, 2000.
9. Preliminary version published in Proceedings of Irregular'99, LNCS 1586, 986-995.