A Bandwidth Latency Tradeoff for Broadcast and Reduction

Sanders, Peter; Sibeyn, Jop F.

Datensatz

DATENSATZ AKTIONENEXPORT

Zur Ablage hinzufügen

Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben

Konferenzbeitrag

A Bandwidth Latency Tradeoff for Broadcast and Reduction

MPG-Autoren

/persons/resource/persons45344

Sanders, Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn, Jop F.
Max Planck Society;

Externe Ressourcen

Es sind keine externen Ressourcen hinterlegt

Volltexte (beschränkter Zugriff)

Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.

Volltexte (frei zugänglich)

Es sind keine frei zugänglichen Volltexte in PuRe verfügbar

Ergänzendes Material (frei zugänglich)

Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar

Zitation

Sanders, P., & Sibeyn, J. F. (2000). A Bandwidth Latency Tradeoff for Broadcast and Reduction. In A. Bode, T. Ludwig, W. Karl, & R. Wismüller (Eds.), Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00) (pp. 918-926). Berlin, Germany: Springer.

Zitierlink: https://hdl.handle.net/11858/00-001M-0000-000F-3364-B

Zusammenfassung

The ``fractional tree'' algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns --- sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.