The information structure of indulgent consensus

IEEE Transactions on Computers

Volumn 53, Issue 4, 2004, Pages 453-466

  Guerraoui, Rachid ^a   Raynal, Michel ^b  

^a EPFL   (Switzerland)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous distributed system; Consensus; Crash failure; Fault tolerance; Indulgent algorithm; Information structure; Leader oracle; Modularity; Random oracle; Unreliable failure detector

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FAULT TOLERANT COMPUTER SYSTEMS; SEMANTICS; SET THEORY; THEOREM PROVING;

ASYNCHRONOUS DISTRIBUTED SYSTEM; CRASH FAILURE; INDULGENT CONSENSUS; INFORMATION STRUCTURE; LEADER ORACLE; MODULARITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1942468125     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2004.1268403     Document Type: Article

References (31)

1. M.K. Aguilera and S. Toueg, "Failure Detection and Randomization: A Hybrid Approach to Solve Consensus," SIAM J. Computing, vol. 28, no. 3, pp. 890-903, 1998.
2. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998.
3. M. Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols," Proc. Second ACM Symp. Principles of Distributed Computing (PODC '83), pp. 27-30, 1983.
4. R. Boichat, P. Dutta, S. Frolund, and R. Guerraoui, "Deconstructing Paxos," SIGACT News, Distributed Computing Column, 2003.
5. F. Brasileiro, F. Greve, A. Mostefaoui, and M. Raynal, "Consensus in One Communication Step," Proc. Sixth Int'l Conf. Parallel Computing Technologies (PaCT '01), pp. 42-50, 2001.
6. J. Brzezinsky, J.-M. Hélary, M. Raynal, and M. Singhal, "Deadlock Models and a General Algorithm for Distributed Deadlock Detection," J. Parallel and Distributed Computing, vol. 31, no. 2, pp. 112-125, 1995.
7. T. Chandra and S. Toueg, "Unreliable Failure Detectors for Reliable Distributed Systems," J. ACM, vol. 43, no. 2, pp. 225-267, 1996.
8. T. Chandra, V. Hadzilacos, and S. Toueg, "The Weakest Failure Detector for Solving Consensus," J. ACM, vol. 43, no. 4, pp. 685-722, 1996.
9. B. Chor and L. Nelson, "Solvability in Asynchronous Environments: Finite Interactive Tasks," SIAM J. Computing, vol. 29, no. 2, pp. 351-377, 1999.
10. F. Chu, "Reducing Ω to ◇W," Information Processing Letters, vol. 67, no. 6, pp. 289-293, 1998.
11. P. Dutta and R. Guerraoui, "Fast Indulgent Consensus with Zero Degradation," Proc. Fourth European Dependable Computing Conf. (EDCC '02), pp. 191-208, 2002.
12. C. Dwork, N. Lynch, and L. Stockmeyer, "Consensus in the Presence of Partial Synchrony," J. ACM, vol. 35, no. 2, pp. 288-323, 1988.
13. M.J. Fischer, N. Lynch, and M.S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, no. 2, pp. 374-382, 1985.
14. E. Gafni, "A Round-by-Round Failure Detector: Unifying Synchrony and Asynchrony," Proc. 17th ACM Symp. Principles of Distributed Computing (PODC '98), pp. 143-152, 1998.
15. R. Guerraoui, "Indulgent Algorithms," Proc. 19th ACM Symp. Principles of Distributed Computing (PODC '00), pp. 289-298, 2000.
16. V. Hadzilacos and S. Toueg, "Reliable Broadcast and Related Problems," Distributed Systems, S. Mullender, ed., pp. 97-145, New-York: ACM Press, 1993.
17. J.-M. Hélary, A. Mostéfaoui, and M. Raynal, "A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1185-1196, Nov. 1994.
18. M. Hurfin, A. MostéFaoui, and M. Raynal, "A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unrealiable Failure Detectors," IEEE Trans. Computers, vol. 51, no. 4, pp. 395-408, Apr. 2002.
19. I. Keidar and S. Rajsbaum, "On the Cost of Fault-Tolerant Consensus when There Are No Faults: A Tutorial," SIGACT News, Distributed Computing Column, vol. 32, no. 2, pp. 45-63, 2001.
20. A.D. Kshemkalyani and M. Singhal, "On the Characterization and Correctness of Distributed Deadlock Detection," J. Parallel and Distributed Computing, vol. 22, no. 1, pp. 44-59, 1994.
21. L. Lamport, "The Part-Time Parliament," ACM Trans. Computer Systems, vol. 16, no. 2, pp. 133-169, 1998.
22. L. Lamport, R. Shostak, and L. Pease, "The Byzantine General Problem," ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, 1982.
23. N. Lynch, Distributed Algorithms. San Francisco: Morgan Kaufmann, 1996.
24. A. Mostéfaoui, S. Rajsbaum, and M. Raynal, "Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems," Proc. 33rd ACM Symp. Theory of Computing (STOC'01), pp. 153-162, 2001.
25. A. Mostéfaoui, S. Rajsbaum, and M. Raynal, "A Versatile and Modular Consensus Protocol," Proc. Int'l IEEE Conf. Dependable Systems & Networks (DSN '02), pp. 364-373, 2002.
26. A. Mostéfaoui and M. Raynal, "Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach," Proc. 13th Int'l Symp. Distributed Computing (DISC '99), pp. 49-63, 1999.
27. A. Mostéfaoui and M. Raynal, "Leader-Based Consensus," Parallel Processing Letters, vol. 11, no. 1, pp. 95-107, 2001.
28. A. Mostéfaoui, M. Raynal, and F. Tronel, "The Best of Both Worlds: A Hybrid Approach to Solve Consensus" Proc. Int'l IEEE Conf. Dependable Systems & Networks (DSN'00), pp. 513-522, 2000.
29. L. Rodrigues and P. Verissimo, "Topology-Aware Algorithms for Large Scale Communications," Advances in Distributed Systems, pp. 127-156, Springer-Verlag, 2000.
30. B. Sanders, "The Information Structure of Distributed Mutual Exclusion Algorithms," ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284-299, 1987.
31. A. Schiper, "Early Consensus in an Asynchronous System with a Weak Failure Detector," Distributed Computing, vol. 10, pp. 149-157, 1997.