Parallel out-of-core matrix inversion
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents a parallel out-of-core algorithm to invert huge dense matrices, that is matrices larger than the available physical memory by one or more orders of magnitude. Preliminary performance results are shown for a commodity cluster. An accurate prediction performance model of the algorithm is given. Thanks to the prediction model, optimizations that avoid the overhead of the out-of-core algorithm are derived. Performance of the optimized algorithm using O(N) memory size are similar to the performance of the best known parallel in-core algorithm using O(N 2 ) memory size (where N is the matrix order). There is no memory restriction for inversion of huge matrices!Keywords
This publication has 5 references indexed in Scilit:
- Parallel out-of-core matrix inversionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Performance Prediction and Analysis of Parallel Out-of-Core Matrix FactorizationPublished by Springer Nature ,2000
- Virtual memory management in data parallel applicationsPublished by Springer Nature ,1999
- ScaLAPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1997
- The design and implementation of SOLAR, a portable library for scalable out-of-core linear algebra computationsPublished by Association for Computing Machinery (ACM) ,1996