Publication: Load-Balanced LU and QR Factor and Solve Routines for Scalable Processors with Scalable I/O
Loading...
Open/View Files
Date
1994
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Brunet, Jean-Philippe, Palle Pedersen, and S. Lennart Johnsson. 1994. Load-Balanced LU and QR Factor and Solve Routines for Scalable Processors with Scalable I/O. Harvard Computer Science Group Technical Report TR-20-94.
Abstract
The concept of block-cyclic order elimination can be applied to out-of-core LU and QR matrix factorizations on distributed memory architectures equipped with a parallel I/O system. This elimination scheme provides load balanced computation in both the factor and solve phases and further optimizes the use of the network bandwidth to perform I/O operations. Stability of LU factorization is enforced by full column pivoting. Performance results are presented for the Connection Machine system CM-5.
Description
Other Available Sources
Research Data
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service