The synchronous condition-based consensus hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3274, Issue , 2004, Pages 1-15

  Mostefaoui, Achour ^a   Rajsbaum, Sergio ^b   Raynal, Michel ^a  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Condition; Consensus; Early deciding; Input Vector; Message passing; Process crash failure; Synchronous distributed system

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; VECTORS;

CONDITION; CONSENSUS; EARLY DECIDING; INPUT VECTOR; PROCESS CRASH FAILURE; SYNCHRONOUS DISTRIBUTED SYSTEMS;

MESSAGE PASSING;

EID: 35048887207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_1     Document Type: Article

References (30)

1. Attiya H., and Avidor Z., Wait-Free n-Set Consensus When Inputs Are Restricted. 16th Int. Symp. on Distributed Computing, Springer Verlag LNCS #2508, pp. 326338, 2002.
2. Aguilera M.K. and Toueg S., A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds. Information Processing Letters, 71:155-178, 1999.
3. Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 451 pages, 1998.
4. Ben Or M., Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83), pp. 27-30, Montréal (CA), 1983.
5. Chaudhuri S., More Choices Allow More Faults: set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
6. Chandra T.K. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, March 1996.
7. Charron-Bost B. and Schiper A., Uniform Consensus is Harder than Consensus. Technical Report DSC/2000/028, EPFL, Lausanne (Switzerland), May 2000.
8. Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., and Weihl, W. E., Reaching Approximate Agreement in the Presence of Faults. JACM, 33(3):499-516, 1986.
9. Dolev D., Reischuk R. and Strong R., Early Stopping in Byzantine Agreement. 1 JACM, 37(4):720-741, April 1990.
10. Dwork C., Lynch N. and Stockmeyer L., Consensus in the Presence of Partial Synchrony. JACM, 35(2):288-323, April 1988.
11. Dwork C. and Moses Y., Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. Information Computation, 88(2):156-186, 1990.
12. Fischer M.J. and Lynch N., A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters, 71:183-186, 1982.
13. Fischer M.J., Lynch N.A. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. JACM, 32(2):374-382, 1985.
14. Friedman R., Mostefaoui A., Rajsbaum S. and Raynal M., Asynchronous Distributed Agreement and its Relation with Error Correcting Codes. 16th Int. Symp. on Distributed Computing, Springer Verlag LNCS #2508, pp. 63-87, 2002.
15. Gafni E., Round-by-round fault detectors: Unifying synchrony and asynchrony. 17th ACM Symp. on Principles of Distributed Computing, pp. 143-152, 1998.
16. Herlihy M.P., Wait-Free Synchronization. ACM TOPLAS, 11(1):124-149, 1991.
17. Hurfin M-, Mostefaoui A. and Raynal M., A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors. IEEE Transactions on Computers, 51(4):395-408, 2002.
18. Herlihy M.P., Rajsbaum S., and Tuttle M.R., Unifying synchronous and asynchronous message-passing models. 17th ACM Symp. on Principles of Distributed Computing, pp. 133-142, 1998.
19. Keidar I. and Rajsbaum S., A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters, 85:47-52, 2003.
20. Lamport L. and Fischer M., Byzantine Generals and Transaction Commit Protocols. Unpublished manuscript, 16 pages, April 1982.
21. Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages, 1996.
22. Moses, Y. and Rajsbaum, S. A Layered Analysis of Consensus, SIAM Journal of Computing 31(4):989-1021, 2002.
23. Mostefaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. JACM, 50(6):922-954, 2003.
24. Mostefaoui A., Rajsbaum S. and Raynal M., Using Conditions to Expedite Consensus in Synchronous Systems. 17th Int. Symposium on Distributed Computing, Springer-Verlag LNCS #2848, pp. 249-263, 2003.
25. Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-based Consensus Sovability: a Hierarchy of Conditions and Efficient Protocols. Distributed Computing, 17:1-20, 2004.
26. Mostefaoui A., Rajsbaum S. and Raynal M., The Synchronous Condition-Based Consensus Hierarchy. Tech Report 1584, 26 pages, IRISA, Univ. de Rennes 1, December 2003. (http://www.irisa.fr/bibli/publi/pi/2003/1584/1584.html).
27. Mostefaoui A. and Raynal M., Leader-Based Consensus. Parallel Processing Letters, 11(1):95-107, 2001.
28. Neiger G. and Toueg S., Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms, 11:374-419, 1990.
29. Raynal M., Consensus in Synchronous Systems: a Concise Guided Tour. 9th IEEE Pacific Rim Int. Symp. on Dependable Computing, pp. 221-228, 2002.
30. Zibin Y., Condition-Based Consensus in Synchronous Systems. 17th Int. Symp. on Distributed Computing, Springer-Verlag LNCS #2848, pp. 239-248, 2003.