A Note on a Simple Equivalence between Round-based Synchronous and Asynchronous Models

Authors:
Michel RAYNAL;Matthieu v
Affiliations:
IRISA Universite de Rennes, France;LAAS-CNRS, Toulouse, France
Venue:
PRDC '05 Proceedings of the 11th Pacific Rim International Symposium on Dependable Computing
Year:
2005

Citing 0
Cited 3

Tight bounds for asynchronous randomized consensus

Journal of the ACM (JACM)
Randomization can be a healer: consensus with dynamic omission failures

DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the power of impersonation attacks

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This short note characterizes a round-based synchronous (timely) computing model that is equivalent to the popular crash prone round-based asynchronous (time-free) distributed computing model. Equivalence means here that any problem that can be solved by a protocol in one model can be solved by the same protocol in the other model. The style of this note is voluntarily informal. Its aim is mainly pedagogical. Its ambition is to help better understand relations linking synchronous and asynchronous distributed computing systems, and the nature of failures that make them difficult to master.