English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

BSP-like external-memory computation

MPS-Authors
/persons/resource/persons45478

Sibeyn,  Jop
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44745

Kaufmann,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-97-1-001.pdf
(Any fulltext), 133KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Sibeyn, J., & Kaufmann, M.(1997). BSP-like external-memory computation (MPI-I-1997-1-001). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-9FD6-C
Abstract
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.