Efficient out-of-core algorithms for linear relaxation using blocking covers

Authors:
C. E. Leiserson;S. Rao;S. Toledo
Affiliations:
Lab. for Comput. Sci., MIT, Cambridge, MA, USA;-;-
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 3

External Memory Algorithms

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Keyword search on external memory data graphs

Proceedings of the VLDB Endowment
Efficient automatic simulation of parallel computation on networks of workstations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

When a numerical computation fails to fit in the primary memory of a serial or parallel computer, a so-called "out-of-core" algorithm must be used which moves data between primary and secondary memories. In this paper, we study out-of-core algorithms for sparse linear relaxation problems in which each iteration of the algorithm updates the state of every vertex in a graph with a linear combination of the states of its neighbors. We give a general method that can save substantially on the I/O traffic for many problems. For example, our technique allows a computer with M words of primary memory to perform T=/spl Omega/(M/sup 1/5/) cycles of a multigrid algorithm for a two-dimensional elliptic solver over an n-point domain using only /spl Theta/(nT/M/sup 1/5/) I/O transfers, as compared with the naive algorithm which requires /spl Omega/(nT) I/O's.