The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Publications of SPCL
|T. Hoefler, A. Barak, A. Shiloh and Z. Drezner:|
|Corrected Gossip Algorithms for Fast Reliable Broadcast on Unreliable Systems|
(In Proceedings of the 31st IEEE International Parallel & Distributed Processing Symposium (IPDPS'17), presented in Orlando, FL, USA, pages , IEEE, ISBN: , May 2017, )
AbstractLarge-scale parallel programming environments and algorithms require efficient group communication on computing systems with failing nodes. Existing reliable broadcast algorithms either cannot guarantee that all nodes are reached or they are very expensive in terms of number of messages and latency. We propose Corrected Gossip, an algorithm that combines Monte Carlo style gossiping with a deterministic correction phase to construct a Las Vegas style reliable broadcast that guarantees to reach all nodes at low cost. We analyze its performance both analytically and using Monte Carlo simulations and we show how our algorithm reduces the latency and network load compared to existing algorithms. Our algorithms improve the latency by 20% and the network load by 53% compared to the fastest known algorithm on 4,096 nodes. We believe that the principle of corrected gossip opens an avenue for many other reliable group communication operations.