Resilient Consensus for Infinitely Many Processes
We provide results for implementing resilient consensus for a (countably) infinite collection of processes.
For a known number of faults, we prove the following equivalence result: For every t≥ 1, there is a t-resilient consensus object for infinitely many processes if and only if there is a t-resilient consensus object for t+1 processes.
For an unknown or infinite number of faults, we consider whether an infinite set of wait-free consensus objects, capable of solving consensus for any finite collection of processes, suffice to solve wait-free consensus for infinitely many processes. We show that this implication holds under an assumption precluding runs in which the number of simultaneously active processes is not bounded, leaving the general question open.
All the proofs are constructive and several of the constructions have adaptive time complexity. (Reduced to the finite domain, some improve on the time complexity of known results.) Furthermore, we prove that the constructions are optimal in some space parameters by providing tight simultaneous-access and space lower bounds. Finally, using known techniques, we draw new conclusions on the universality of resilient consensus objects in the infinite domain.
- Aspnes, J., Shah, G., Shah, J.: Wait-free consensus with infinite arrivals. In: Proc. 34th Annual Syrup. on Theory of Computing, May 2002, pp. 524–533 (2002)
- Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. In: Proc. 19th ACM Symp. on Principles of Distributed Computing, July 2000, pp. 91–100 (2000)
- Borowsky, E., Gafni, E., Afek, Y.: Consensus power makes (some) sense! In: Proc. 13th ACM Syrup. on Principles of Distributed Computing, August 1994, pp. 363–372 (1994)
- Chandra, T., Hadzilacos, V., Jayanti, P., Toueg, S.: Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In: Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994, pp. 334–343 (1994), Expanded version: www.cs.toronto.edu/vassos/research/list-of-publications.html
- Chocker, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proc. 21th ACM Symp. on Principles of Distributed Computing, July 2002, pp. 78–87 (2002)
- Fich, F., Herlihy, M., Shavit, N.: On the Space Complexity of Randomized Synchronization. Journal of the ACM 45(5), 843–862 (1998) CrossRef
- Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985) CrossRef
- Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proc. 20th ACM Symp. on Principles of Distributed Computing, August 2001, pp. 161–169 (2001)
- Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990) CrossRef
- Herlihy, M.P.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991) CrossRef
- Jayanti, P., Toueg, S.: Some results on the impossibility, universality and decidability of consensus. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 69–84. Springer, Heidelberg (1992)
- Lo, W.K., Hadzilacos, V.: On the power of shared objects to implement one-resilient consensus. Distributed Computing 13(4), 219–238 (2000) CrossRef
- Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research 4, 163–183 (1987)
- Malkhi, D., Merritt, M., Reiter, M., Taubenfeld, G.: Objects shared by Byzantine processes. Distributed Computing 16(1), 37–48 (2003); Also in Herlihy, M.P. (ed.): DISC 2000. LNCS, vol. 1914, pp. 345–359. Springer, Heidelberg (2000) CrossRef
- Merritt, M., Taubenfeld, G.: Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters 45, 137–142 (1991); Also published as an AT&T technical memorandum (May 1991) CrossRef
- Merritt, M., Taubenfeld, G.: Computing with ininitely many processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000) CrossRef
- Plotkin, S.A.: Sticky bits and universality of consensus. In: Proc. 8th ACM Symp. on Principles of Distributed Computing, August 1989, pp. 159–175 (1989)
- Resilient Consensus for Infinitely Many Processes
- Book Title
- Distributed Computing
- Book Subtitle
- 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003. Proceedings
- pp 1-15
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.