Key concepts for parallel out-of-core LU factorization
| Autor: | Jack Dongarra, David W. Walker, Sven Hammarling |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Parallel computing
Computer Networks and Communications Computer science Performance Out-of-core LU factorization Theoretical Computer Science law.invention Artificial Intelligence Simple (abstract algebra) law Modelling and Simulation Performance model Intel Paragon ScaLAPACK Dense matrices Incomplete LU factorization Computer Graphics and Computer-Aided Design Parallel I/O LU decomposition Computational Mathematics Computational Theory and Mathematics Hardware and Architecture Modeling and Simulation Key (cryptography) Out-of-core algorithm Software |
| Zdroj: | Scopus-Elsevier |
| ISSN: | 0898-1221 |
| DOI: | 10.1016/s0898-1221(98)00029-7 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect