Loading...
Please wait, while we are loading the content...
Similar Documents
The Design and Implementation of the Parallel Out-of-Core ScaLAPACK LU, QR and Cholesky Factorization Routines (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | D.'Azevedo, E. F. Dongarra, J. J. |
| Abstract | This paper describes the design and implementation of three core factorization routines --- LU, QR and Cholesky --- included in the out-of-core extension of ScaLAPACK. These routines allow the factorization and solution of a dense system that is too large to fit entirely in physical memory. An image of the full matrix is maintained on disk and the factorization routines transfer sub-matrices into memory. The `left-looking' column-oriented variant of the factorization algorithm is implemented to reduce the disk I/O traffic. The routines are implemented using a portable I/O interface and utilize high performance ScaLAPACK factorization routines as in-core computational kernels. We present the details of the implementation for the out-of-core ScaLAPACK factorization routines, as well as performance and scalability results on the Intel Paragon. 1 This work was supported in part by the National Science Foundation Grant No. ASC-9005933; by the Defense Advanced Research Projects Agency under... |
| File Format | |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Intel Paragon Parallel Out-of-core Scalapack Lu Full Matrix Cholesky Factorization Routine Dense System Out-of-core Scalapack Factorization Routine Scalability Result Core Factorization Routine Lu In-core Computational Kernel Factorization Routine Column-oriented Variant National Science Foundation Grant Out-of-core Extension Defense Advanced Research Project Agency Physical Memory Factorization Algorithm |
| Content Type | Text |
| Resource Type | Article |
