Block data distribution for parallel nested dissection
Conference
·
OSTI ID:125564
- Universite Bordeaux, Talence (France)
In this paper, we consider the problem of data partitioning for block sparse Cholesky factorization on distributed memory MIMD computers. We propose a preprocessing algorithm which computes and distributes a column block partition based on an initial partition induced by a nested dissection ordering. This preprocessing algorithm works by optimizing load balancing under precedence constraints and communication traffic. It can be performed in linear time and space complexities.
- OSTI ID:
- 125564
- Report Number(s):
- CONF-950212--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A nested dissection approach to sparse matrix partitioning for parallel computations.
Improved parallel data partitioning by nested dissection with applications to information retrieval.
A new torus-like mapping for parallel sparse matrix factorization
Journal Article
·
Fri Aug 01 00:00:00 EDT 2008
· Proposed for publication in SIAM Journal on Scientific Computing.
·
OSTI ID:947836
Improved parallel data partitioning by nested dissection with applications to information retrieval.
Journal Article
·
Sun Nov 30 23:00:00 EST 2008
· Proposed for publication in Parallel Computing.
·
OSTI ID:970310
A new torus-like mapping for parallel sparse matrix factorization
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:55318