The perfectly synchronized round-based model of distributed computing

  • Authors:

  • Carole Delporte-Gallet;Hugues Fauconnier;Rachid Guerraoui;Bastian Pochon

  • Affiliations:

  • LIAFA Institute, Université Denis Diderot, F-75251 Paris 5, France;LIAFA Institute, Université Denis Diderot, F-75251 Paris 5, France;School of Computer and Communication Sciences, EPFL, CH-1015 Lausanne, Switzerland;School of Computer and Communication Sciences, EPFL, CH-1015 Lausanne, Switzerland

  • Venue:
  • Information and Computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The perfectly synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy. We describe a technique to automatically transform protocols devised in the perfectly synchronized round-based model into protocols for the crash, send omission, general omission or Byzantine models. Our transformation is achieved using a round shifting technique with a constant time complexity overhead. The overhead depends on the target model: crashes, send omissions, general omissions or Byzantine failures. Rather surprisingly, we show that no other automatic non-uniform transformation from a weaker model, say from the traditional crash-stop model (with no atomic message delivery), onto an even stronger model than the general-omission one, say the send-omission model, can provide a better time complexity performance in a failure-free execution.