Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987
Technical Report
·
OSTI ID:5668318
A parallel algorithm is developed for Cholesky factorization on a shared-memory multiprocessor. The algorithm is based on self-scheduling of a pool of tasks. The subtasks in several variants of the basic elimination algorithm are analyzed for potential concurrency in terms of precedence relations, work profiles, and processor utilization. This analysis is supported by simulation results. The most promising variant, which the authors call column-Cholesky, is identified and implemented for the Denelcor HEP multiprocessor. Experimental results are given for this machine.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- OSTI ID:
- 5668318
- Report Number(s):
- AD-A-186051/9/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel Cholesky factorization on a multiprocessor
Computational models and task scheduling for parallel sparse Cholesky factorization. Final report, 1 October 1986-30 September 1987
A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
Technical Report
·
Thu Feb 28 23:00:00 EST 1985
·
OSTI ID:6116853
Computational models and task scheduling for parallel sparse Cholesky factorization. Final report, 1 October 1986-30 September 1987
Technical Report
·
Wed Oct 01 00:00:00 EDT 1986
·
OSTI ID:5384897
A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
Journal Article
·
Thu Jul 01 00:00:00 EDT 1993
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:7369124