Sciweavers

Share
IANDC
2007

The perfectly synchronized round-based model of distributed computing

9 years 2 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op 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. s: Abstraction, simulation, distributed systems, fa...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2007
Where IANDC
Authors Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon
Comments (0)
books