The perfectly synchronized round-based model of distributed computing

  • Delporte-Gallet C
  • Fauconnier H
  • Guerraoui R
 et al. 
  • 3


    Mendeley users who have this article in their library.
  • 6


    Citations of this article.


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 roundbased 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. © 2006 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Abstraction
  • Complexity
  • Distributed systems
  • Fault-tolerance
  • Simulation
  • Synchronous system models

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Carole Delporte-Gallet

  • Hugues Fauconnier

  • Rachid Guerraoui

  • Bastian Pochon

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free