Parallel Cholesky factorization on a multiprocessor
Technical Report
·
OSTI ID:6116853
A parallel algorithm is developed for Cholesky factorization on a 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 we 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)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6116853
- Report Number(s):
- ORNL-6124; ON: DE85008762
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987
Computational models and task scheduling for parallel sparse Cholesky factorization. Final report, 1 October 1986-30 September 1987
Parallel Cholesky factorization in message-passing multiprocessor environments
Technical Report
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5668318
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
Parallel Cholesky factorization in message-passing multiprocessor environments
Technical Report
·
Wed May 01 00:00:00 EDT 1985
·
OSTI ID:5696573