Parallel implementation of multifrontal schemes
Technical Report
·
OSTI ID:5593530
We consider the direct solution of large sparse sets of linear equations in an MIMD environment. We base our algorithm on a multifrontal approach and show how to distribute tasks among processors according to an elimination tree that can be automatically generated from any pivot strategy. We study organizational aspects of the scheme for shared memory multiprocessor configurations and consider implications for multiprocessors with local memories and a communication network.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 5593530
- Report Number(s):
- ANL/MCS-TM-49; ON: DE85014295
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel multifrontal solution of sparse linear least squares problems on distributed-memory multiprocessors
A mapping algorithm for parallel sparse Cholesky factorization
Communication reduction in parallel sparse Cholesky factorization on a hypercube
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125545
A mapping algorithm for parallel sparse Cholesky factorization
Journal Article
·
Wed Sep 01 00:00:00 EDT 1993
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:6107258
Communication reduction in parallel sparse Cholesky factorization on a hypercube
Conference
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7043785