Discamus continentiam augere, luxuriam coercere
Home -> Publications
Home
  Publications
    
edited volumes
  Awards
  Research
  Teaching
  Miscellaneous
  Full CV [pdf]
  BLOG






  Events








  Past Events





Publications of Torsten Hoefler
Torsten Hoefler, Amnon 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, IEEE, May 2017)

Abstract

Large-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.

Documents

download article:
download slides:
 

BibTeX

@inproceedings{corrected-gossip,
  author={Torsten Hoefler and Amnon Barak and A. Shiloh and Z. Drezner},
  title={{Corrected Gossip Algorithms for Fast Reliable Broadcast on Unreliable Systems}},
  year={2017},
  month={May},
  booktitle={Proceedings of the 31st IEEE International Parallel \& Distributed Processing Symposium (IPDPS'17)},
  location={Orlando, FL, USA},
  publisher={IEEE},
  source={http://www.unixer.de/~htor/publications/},
}


serving: 52.15.49.90:23078© Torsten Hoefler