Bundling Messages to Reduce the Cost of Tree-Based Broadcast Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year :

Bundling Messages to Reduce the Cost of Tree-Based Broadcast Algorithms

(1) , (2) , (3, 4) , (3, 4) , (3, 4)
1
2
3
4

Abstract

Hierarchical broadcast strategies based on trees are scalable since they distribute the workload among processes and disseminate messages in parallel. In this work we propose an efficient best-effort broadcast algorithm that employs multiple spanning trees to propagate messages that are bundled on tree intersections. The algorithm is autonomic in the sense that it employs dynamic trees rooted at the source process and which rebuild themselves after processes crash. Experimental results obtained with simulation are presented showing the performance to the algorithm in terms of the latency and the number and sizes of messages employed.
Fichier principal
Vignette du fichier
bundling_hypercube.pdf (670.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01959395 , version 1 (18-12-2018)

Identifiers

Cite

Luiz A. Rodrigues, Elias P Duarte Júnior, João Paulo de Araujo, Luciana Arantes, Pierre Sens. Bundling Messages to Reduce the Cost of Tree-Based Broadcast Algorithms. LADC 2018 - 8th Latin-American Symposium on Dependable Computing, Oct 2018, Foz do Iguaçu, Brazil. ⟨10.1109/LADC.2018.00022⟩. ⟨hal-01959395⟩
58 View
297 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More