A Stable Broadcast Algorithm

—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms explicitly or implicitly try to deliver data to all nodes in the same rate. While being reasonable for homogeneous environments where all nodes have similar receiving capababilities, such algorithms may suffer from slowly receiving nodes in heterogeneous settings. In such settings, each node desires to receive data at its largest possible bandwidth and start computation as soon as it receives the data. In this paper we propose to say a broadcast is stable when the bandwidth to a node is never sacrificed by the presence of other, possibly slow, receiving nodes, and proposes the stability as a desired property of broadcast algorithms. In addition, we show a simple and efficient stable broadcast when the topology among nodes is a tree and each link has a symmetric bandwidth. This work improves upon previously p...

• Type: Conference
• Year: 2008
• Where: CCGRID
• Authors: Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenjiro Taura
• Keywords: Broadcast Algorithms, CCGRID 2008, Cluster Computing, Largest Possible Bandwidth, Similar Receiving Capababilities