A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization

Authors:
Pascal Hénon;Pierre Ramet;Jean Roman
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 9
Cited 8

A fan-in algorithm for distributed sparse numerical factorization

SIAM Journal on Scientific and Statistical Computing
Task scheduling for parallel sparse Cholesky factorization

International Journal of Parallel Programming
A mapping algorithm for parallel sparse Cholesky factorization

SIAM Journal on Scientific Computing
An efficient block-oriented approach to parallel sparse Cholesky factorization

SIAM Journal on Scientific Computing
Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers

SIAM Journal on Scientific Computing
An Approximate Minimum Degree Ordering Algorithm

SIAM Journal on Matrix Analysis and Applications
Improved load distribution in parallel sparse cholesky factorization

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Sparse Matrix Ordering with SCOTCH

HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing

Analysis and comparison of two general sparse solvers for distributed memory computers

ACM Transactions on Mathematical Software (TOMS)
PASTIX: a high-performance parallel direct solver for sparse symmetric positive definite systems

Parallel Computing - Parallel matrix algorithms and applications
PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Scalable Parallel Assembly for Irregular Meshes Based on a Block Distribution for a Parallel Block Direct Solver

PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization

Parallel Computing
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

ACM Transactions on Mathematical Software (TOMS)
Asynchronous progressive irregular prefix operation in HPF2

EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present and analyze a general algorithm which computes efficient static schedulings of block computations for parallel sparse linear factorization. Our solver, based on a supernodal fan-in approach, is fully driven by this scheduling. We give an overview of the algorithms and present performance results on a 16-node IBM-SP2 with 66 MHz Power2 thin nodes for a collection of grid and irregular problems.