The Perfectly-Synchronized Round-based Model of Distributed Computing

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.

Published in:
Information & Computation, 205, 5, 783-815
Other identifiers:

Note: The status of this file is: Anyone

 Record created 2007-06-25, last modified 2020-04-20

Rate this document:

Rate this document:
(Not yet reviewed)