Broadcast Trees for Heterogeneous Platforms.

Abstract : In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree is used to implement this operation, and the objective is to find the tree which maximizes the throughput, i.e. the average number of slices sent by the source processor every time-unit. We introduce several heuristics to solve this problem. The good news is that the best heuristics perform quite efficiently, reaching more than 70% of the absolute optimal throughput, thereby providing a simple yet efficient approach to achieve very good performance for broadcasting on heterogeneous platforms.
Document type :
Reports
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101806
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:06:48 AM
Last modification on : Thursday, November 21, 2019 - 2:38:38 AM

File

RR2004-46.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101806, version 1

Collections

Citation

Olivier Beaumont, Loris Marchal, Yves Robert. Broadcast Trees for Heterogeneous Platforms.. [Research Report] Laboratoire de l'informatique du parallélisme; LIP RR-2004-46. 2004, 2+18p. ⟨hal-02101806⟩

Share

Metrics

Record views

24

Files downloads

43