BSP-like External-memory Computation

Sibeyn, Jop; Kaufmann, Michael

doi:10.1007/3-540-62592-5_75

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

BSP-like External-memory Computation

MPS-Authors

/persons/resource/persons45478

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

External Resource

https://rdcu.be/dvw6U
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Sibeyn, J., & Kaufmann, M. (1997). BSP-like External-memory Computation. In G. Bongiovanni, D. P. Bovet, & G. Di Battista (Eds.), Algorithms and Complexity (pp. 229-240). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3904-6

Abstract

In this paper we present a paradigm for solving external-memory
problems, and illustrate it by algorithms for matrix multiplication,
sorting and list ranking. 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. So the
predicted performances are more useful for practical applications.