loading...
A Note on a Simple Equivalence between Round-based Synchronous and Asynchronous Models
Changsha, Hunan, China December 12-December 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2005.1011th Pacific Rim International Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Michel RAYNAL, IRISA Universite de Rennes, France
Matthieu v, LAAS-CNRS, Toulouse, France
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.
Citation:
Michel RAYNAL, Matthieu v, "A Note on a Simple Equivalence between Round-based Synchronous and Asynchronous Models," prdc, pp.387-392, 11th Pacific Rim International Symposium on Dependable Computing (PRDC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.