A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

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

*
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
*

When a numerical computation fails to fit in the primary memory of a serial or parallel computer, a so-called"out-of-core" algorithm, which moves data between primary and secondary memories, must be used. 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

doi:10.1109/sfcs.1993.366817
dblp:conf/focs/LeisersonRT93
fatcat:r7ieaeypsngn3adhzc3owrtu2y