MPI-I-97-1-001

BSP-like external-memory computation

Sibeyn, Jop F. and Kaufmann, Michael

MPI-I-97-1-001. January 1997, 14 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
In this paper we present a paradigm for solving external-memory
problems, and illustrate it by algorithms for matrix multiplication,
sorting, list ranking, transitive closure and FFT. Our paradigm is
based on the use of BSP algorithms. The correspondence is almost
perfect, and especially the notion of x-optimality carries over
to algorithms designed according to our paradigm.

The advantages of the approach are similar to the advantages of
BSP algorithms for parallel computing: scalability, portability,
predictability. The performance measure here is the total work, not
only the number of I/O operations as in previous approaches. The
predicted performances are therefore more useful for practical
applications.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	101 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1997-1-001

BibTeX
@TECHREPORT{SibeynKaufmann97, AUTHOR = {Sibeyn, Jop F. and Kaufmann, Michael}, TITLE = {BSP-like external-memory computation}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-97-1-001}, MONTH = {January}, YEAR = {1997}, ISSN = {0946-011X},}