A note on a simple equivalence between round-based synchronous and asynchronous models

Proceedings - 11th Pacific Rim International Symposium on Dependable Computing, PRDC 2005

Volumn 2005, Issue , 2005, Pages 387-390

  Raynal, Michel ^a   Matthieu, Roy ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING;

ASYNCHRONOUS DISTRIBUTED COMPUTING SYSTEMS; ASYNCHRONOUS MODELS; DISTRIBUTED COMPUTING MODEL;

MATHEMATICAL INSTRUMENTS;

EID: 33847255013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PRDC.2005.10     Document Type: Conference Paper

References (19)

1. Aho A.V. and Ullman J.D., Foundations of Computer Science. Computer Science press, 765 pages, 1992.
2. Attiya H., Bar-Noy A. and Dolev D., Sharing Memory Robustly in Message-passing Systems. Journal of ACM, 42(1):124-142, 1995.
3. Attiya H. and Welch J. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 451 pages, 1988.
4. Awerbuch B., Complexity of Network Synchonization. Journal ACM, 32(4):805-823, 1985.
5. Chandra T.K. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM, 43(2):225-267, 1996.
6. Cristian F. and Fetzer C., The Timed Asynchronous System Model. IEEE Trans. on Par. and Distr. Systems, 10(6):642-657, 1999.
7. Fischer M.J., Lynch N.A. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, 32(2):374-382, 1985.
8. Lamport L., Shostak R. and Pease L., The Byzantine General Problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
9. Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., San Fransisco (CA), 872 pages, 1996.
10. Moses Y. and Rajsbaum S., A Layered Analysis of Consensus. SIAM Journal of Computing, 31(4):989-1021, 2002.
11. Neiger G. and Toueg S., Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms, 11:374-419, 1990.
12. Perry K.J. and Toueg S., Distributed Agreement in the Presence of Processor and Communication Faults. IEEE Transactions on Software Engineering, SE-12(3):477-482, 1986.
13. Powell D., Failure Mode Assumptions and Assumption Coverage. Proc. of the 22nd Int'l Symposium on Fault-Tolerant Computing (FTCS-22), Boston, MA, pp.386-395, 1992.
14. Raynal M., Consensus in Synchronous Systems: a Concise Guided Tour. Proc. 9th IEEE Pacific Rim Int'l Symposium on Dependable Computing (PRDC'02), Tsukuba (Japan), IEEE Comp. Press, pp. 221-228, 2002.
15. Raynal M., A Short Introduction to Failure Detectors for Asynchronous Distributed Systems. ACM Sigact News, Distributed Computing Column, 36(1):53-70, 2005.
16. Ren Y., Cukier M. and Sanders W.H., An Adaptive Algorithm for Tolerating Values Faults and Crash Failures. IEEE Transactions on parallel and Distributed Systems, 12(2): 173-192, 2001.
17. Santoro N. and Widmayer P., Time is not a Healer. Proc. 6th Symposium on Theoretical Aspects of Computer Science (STACS'89), Springer Verlag #349, pp. 304-313, Paderborm (Germany), 1989.
18. Santoro N. and Widmayer P., Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. Proc. 12th Colloquium on Structural Information and Communication Complexity (SIROCCO'05), Springer Verlag LNCS #2499, pp. 262-276, (A. Pelc and M. Raynal, Eds), Le Mont-Saint-Michel (France), May 2005.
19. Schneider F.B., What Good are Models and what Models are Good? Chapter 2, Distributed Systems (2nd edition), Addison-Wesley and ACM Press, pp. 15-26, 1993.