de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

BSP-Like External-Memory Computation

MPG-Autoren

Sibeyn,  Jop F.
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44745

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Sibeyn, J. F., & Kaufmann, M. (1997). BSP-Like External-Memory Computation. In G. Bongiovanni, D. P. Bovet, & G. Di Battista (Eds.), Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97) (pp. 229-240). Berlin: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3904-6
Zusammenfassung
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.