Parallel Cholesky factorization on a hypercube multiprocessor
Technical Report
·
OSTI ID:5304680
Two types of message-passing parallel algorithms are developed for solving symmetric systems of linear equations on a hypercube multiprocessor. One type involves broadcast communication among processors, and the other involves communication along a ring of processors. Details are provided in the form of C programs that implement the algorithms on a hypercube simulator and which should run with little modification on real hypercube hardware. Performance of the various algorithms is demonstrated by means of processor utilization graphs and parallel speedup curves.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 5304680
- Report Number(s):
- ORNL-6190; ON: DE85018121
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sparse Cholesky factorization on a local-memory multiprocessor
Sparse Cholesky factorization on a local-memory multiprocessor
Parallel and fault-tolerant algorithms for hypercube multiprocessors
Technical Report
·
Mon Mar 31 23:00:00 EST 1986
·
OSTI ID:5868908
Sparse Cholesky factorization on a local-memory multiprocessor
Journal Article
·
Mon Feb 29 23:00:00 EST 1988
· SIAM J. Sci. Stat. Comput.; (United States)
·
OSTI ID:5152267
Parallel and fault-tolerant algorithms for hypercube multiprocessors
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5921851