Abstract
This paper considers key ideas in the design of out-of-core dense LU factorization routines. A left-looking variant of the LU factorization algorithm is shown to require less I/O to disk than the right-looking variant, and is used to develop a parallel, out-of-core implementation. This implementation makes use of a small library of parallel I/O routines, together with ScaLAPACK and PBLAS routines. Results for runs on an Intel Paragon are presented and interpreted using a simple performance model.
| Original language | English |
|---|---|
| Pages (from-to) | 13-31 |
| Number of pages | 19 |
| Journal | Computers and Mathematics with Applications |
| Volume | 35 |
| Issue number | 7 |
| DOIs | |
| State | Published - Apr 1998 |
| Externally published | Yes |
Funding
This paper presents a prototype for the design of a parallel software library for the out-of core solution of dense linear systems, and presents timing results for runs on an Intel Paragon. Other The authors acknowledge the use of the Intel Paragon XP/S 5 computer, located in the Oak Ridge National Laboratory Center for Computational Sciences (CCS), funded by the Department of Energy's Mathematical, Information, and Computational Sciences (MICS) Division of the Office of Computational and Technology Research (OCTR).
| Funders | Funder number |
|---|---|
| OCTR | |
| Office of Computational and Technology Research | |
| U.S. Department of Energy | |
| Oak Ridge National Laboratory |
Keywords
- Dense matrices
- Out-of-core LU factorization
- Parallel computing
- Performance