The alpha of indulgent consensus

Computer Journal

Volumn 50, Issue 1, 2007, Pages 53-67

  Guerraoui, Rachid ^a   Raynal, Michel ^b  

^a EPFL   (Switzerland)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Asynchronous system; Consensus; Disk; Message passing; Shared memory

Indexed keywords

ALGORITHMS; DATA TRANSFER; MAGNETIC DISK STORAGE; SECURITY OF DATA;

ACTIVE DISK SYSTEMS; ASYNCHRONOUS SYSTEM; COMMUNICATION MEDIA; CONSENSUS ALGORITHMS; MESSAGE PASSING; SHARED MEMORY; STORAGE AREA NETWORK;

DATA STORAGE EQUIPMENT;

EID: 33845627410     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl046     Document Type: Article

References (32)

1. Fischer, M. J., Lynch, N. and Paterson, M. S. (1985) Impossibility of distributed consensus with one faulty process. J. ACM, 32(2), 374-382.
2. Guerraoui, R. (2000) Indulgent algorithms. In Proc. 19th ACM Symp. Principles of Distributed Computing, Portland, OR, USA, July 16-19, pp. 289-298. ACM Press, New York.
3. Dwork, C., Lynch, N. and Stockmeyer, L. (1988) Consensus in the presence of partial synchrony. J. ACM, 35(2), 288-323.
4. Chandra, T. and Toueg, S. (1996) Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2), 225-267.
5. Chandra, T., Hadzilacos, V. and Toueg, S. (1996) The weakest failure detector for solving consensus. J ACM, 43(4), 685-722.
6. Raynal, M. (2005) A short introduction to failure detectors for asynchronous distributed systems. ACM Sigact News, Distr. Comput. Column, 36(1), 53-70.
7. Aguilera, M. K. (2004) A pleasant stroll through the land of infinitely many creatures. ACM Sigact News, Distr. Comput. Column, 35(2), 36-59.
8. Chockler, G. V. and Malkhi, D. (2002) Active disk paxos with infinitely many processes. In Proc. 21th ACM Symp. Principles of Distributed Computing, Monterey, CA, USA, July 21-24, pp. 78-87. ACM Press, New York.
9. Merritt, M. and Taubenfeld, G. (2000) Computing with infinitely many processes. In Proc. 14th Symp. Distributed Computing, Toledo, Spain, pp. 164-178, LNCS, 1914. Springer-Verlag, Berlin.
10. Attiya, H. and Welch, J. (2004) Distributed Computing, Fundamentals, Simulation and Advanced Topics (2nd ed.). Wiley Series on Parallel and Distributed Computing. Wiley, New York.
11. Gafni, E. and Lamport, L. (2003) Disk paxos. Distr. Comput., 16(1), 1-20.
12. Lamport, L. (1998) The part-time parliament. ACM Trans. Comput. Syst., 16(2), 133-169, (A first version appeared as DEC Research Report, #49, September 1989).
13. Boichat, R., Dutta, P., Frølund, S. and Guerraoui, R. (2003) Deconstructing paxos. ACM Sigact News, Distr. Comput. Column, 34(1), 47-67.
14. Guerraoui, R. and Raynal, M. (2004) The information structure of indulgent consensus. IEEE Trans. Comput., 53(4), 453-466.
15. Boichat, R., Dutta, P., Frølund, S. and Guerraoui, R. (2003) Reconstructing paxos. ACM Sigact News, Distr. Comput. Column, 34(2), 42-57.
16. Lamport, L. (1978) Time, clocks and the ordering of events in a distributed system. Commun. ACM, 21(7), 558-565.
17. de Prisco, R., Lampson, B. W. and Lynch, N. A. (2000) Revisiting the paxos algorithm. Theor. Comp. Sci., 243(1-2), 35-91.
18. Lamport, L. (2001) Paxos made simple. ACM Sigact News, Dist. Comput. Column, 32(4), 34-58.
19. Lampson, B. W. (1996) How to build a highly available system using consensus. In Proc. 10th Int Workshop on Distributed Algorithms, Bologna, Italy, October 9-11, pp. 1-17 in LNCS 1151. Springer-Verlag, Berlin.
20. Abraham, I., Chockler, G. V., Keidar, I. and Malkhi, D. (2004) Byzantine disk paxos, optimal resilience with Byzantine shared memory. In Proc. 23th ACM Symp. Principles of Distributed Computing, St. John's, Newfoundland, Canada, July 22-25, pp. 226-235. ACM Press, New York.
21. Guerraoui, R. and Raynal, M. (2006) A leader election protocol for eventually synchronous shared memory systems. In Proc. 4th Int IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS'06), Gyeongju, Korea, April 26-28, pp. 75-80., IEEE Computer Society Press, Los Alamitos, CA.
22. Dutta, P. and Guerraoui, R. (2002) Fast indulgent consensus with zero degradation. In Proc. 4th European Dependable Computing Conf., Toulouse, France, October 23-25, pp. 191-208 LNCS 2485, Springer-Verlag, Berlin.
23. Mostéfaoui, A. and Raynal, M. (2001) Leader-based consensus. Parallel Process. Lett., 11(1), 95-107.
24. Neiger, G. (1995) Failure detectors and the wait-free hierarchy. In Proc. 14th ACH Symp. Principles of Distributed Computing, Ottawa, Ontario, Canada, July 20-23, pp. 100-109, ACM Press, New York.
25. Aguilera, M. K., Delporte-Gallet, C., Fauconnier, H. and Toueg, S. (2004) Communication-efficient leader election and consensus with limited link synchrony. In Proc. 23th ACH Symp. on Principles of Distributed Computing, St John's, Newfoundland, Canada, July 22-25, pp. 328-337. ACM Press, NewYork.
26. Larrea, M., Fernández, A. and Arèvalo, S. (2000) Optimal implementation of the weakest failure detector for solving consensus. In Proc. 19th Symp. Reliable Distributed Systems, Numberg, Germany, October 16-18, pp. 52-60. IEEE Computer Society Press, Los Alamitos, CA.
27. Mostéfaoui, A., Raynal, M. and Travers, C. (2004) Crash resilient time-free eventual leadership. In Proc. 23th Symp. Reliable Distributed Systems, Florianópolis, Brazil, October 18-20, pp. 208-218. IEEE Computer Society Press, Los Alamitos, CA.
28. Mostéfaoui, A., Raynal, M. and Travers, C. (2006) Time-free and timer-based assumptions can be combined to get eventual leadership. IEEE Trans. Parallel and Distr. Syst., 17(7), 656-666.
29. Lamport, L. (1986) On interprocess communication. Distr. Comput., 1(2), 77-101.
30. Aguilera, M. K., Englert, B. and Gafni, E. (2003) On using network attached disks as shared memory. In Proc. 21th ACH Symp. Principles of Distributed Computing, Boston, MA, USA, July 13-16, pp. 315-324. ACM Press, New York.
31. Gibson, G. A. et al. (1998) A cost-effective high-bandwidth storage architecture. In Proc. 8th Int Conf. Architectural Support for Programming Languages and Operating Systems, San Jose, CA, USA, October 4-7, pp. 92-103. ACM Press, New York.
32. Bernstein, P. A. and Goodman, N. (1981) Concurrency control in distributed data base systems. ACM Comput. Survey, 13(2), 185-221.