PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions

Authors:
Pascal Hénon;Pierre Ramet;Jean Roman
Affiliations:
-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

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
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
A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

PASTIX: a high-performance parallel direct solver for sparse symmetric positive definite systems

Parallel Computing - Parallel matrix algorithms and applications
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
Improving performance by embedding HPC applications in lightweight Xen domains

Proceedings of the 2nd workshop on System-level virtualization for high performance computing
StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Design of a Multicore Sparse Cholesky Factorization Using DAGs

SIAM Journal on Scientific Computing
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
Building portable thread schedulers for hierarchical multiprocessors: the bubblesched framework

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We presen t and analyze a general algorithm which computes an efficient static scheduling of block computations for a parallel L:D:Lt factorization of sparse symmetric positive definite systems based on a combination of 1D and 2D block distributions. Our solver uses a supernodal fan-in approach and is fully driven by this scheduling. We give an overview of the algorithm and present performance results and comparisons with PSPASES on an IBM-SP2 with 120 MHz Pow er2SC nodes for a collection of irregular problems.