Parallel Cholesky factorization in message-passing multiprocessor environments
Technical Report
·
OSTI ID:5696573
Parallel algorithms are presented for computing the Cholesky factorization on multiprocessors having only private local memory. Synchronization of multiple processes is based on message passing. Several possible processor interconnection networks are considered.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 5696573
- Report Number(s):
- ORNL-6150; ON: DE85012079
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems
Parallel Cholesky factorization on a multiprocessor
Message-passing multiprocessor simulator
Conference
·
Wed Jul 01 00:00:00 EDT 1992
·
OSTI ID:10159845
Parallel Cholesky factorization on a multiprocessor
Technical Report
·
Thu Feb 28 23:00:00 EST 1985
·
OSTI ID:6116853
Message-passing multiprocessor simulator
Technical Report
·
Thu May 01 00:00:00 EDT 1986
·
OSTI ID:5760616