Communication reduction in parallel sparse Cholesky factorization on a hypercube
Conference
·
OSTI ID:7043785
We consider the problem of reducing data traffic among processor nodes in the parallel factorization of a sparse matrix on a hypercube multiprocessor. A task assignment strategy based on the structure of an elimination tree is presented. This assignment is aimed at achieving load balancing among the processors and also reducing the amount of processor-to-processor data communication. Some experimental results on the performance of this scheme are presented. 8 refs., 2 tabs.
- Research Organization:
- Oak Ridge National Lab., TN (USA); York Univ., Toronto, Ontario (Canada). Dept. of Computer Science
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 7043785
- Report Number(s):
- CONF-8609173-3; ON: DE87002625
- Country of Publication:
- United States
- Language:
- English
Similar Records
A partitioning strategy for parallel sparse Cholesky factorization
Communication cost of sparse Cholesky factorization on a hypercube
Sparse Cholesky factorization on a local-memory multiprocessor
Technical Report
·
Mon Oct 31 23:00:00 EST 1988
·
OSTI ID:6547279
Communication cost of sparse Cholesky factorization on a hypercube
Technical Report
·
Wed Nov 30 23:00:00 EST 1988
·
OSTI ID:5754944
Sparse Cholesky factorization on a local-memory multiprocessor
Technical Report
·
Mon Mar 31 23:00:00 EST 1986
·
OSTI ID:5868908