Load-Balanced LU and QR Factor and Solve Routines for Scalable Processors with Scalable I/O
Johnsson, S. LennartNote: Order does not necessarily reflect citation order of authors.
MetadataShow full item record
CitationBrunet, 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.
AbstractThe 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:25811010
- FAS Scholarly Articles