DISC 2002: Distributed Computing pp 326-338 | Cite as
Wait-Free n-Set Consensus When Inputs Are Restricted
Conference paper
First Online:
Abstract
The k-set consensus problem requires processes to decide on at most k of their input values. The problem can be solved using only read / write operations in the presence of f crash failures if and only if f < k. One way to subvert this impossibility result is to restrict the set of possible assignments of input values to processes. This paper presents a characterization of the input restrictions that allow a wait-free solution of n-set consensus in a system with n + 1 processes, using only read and write operations.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation 103 (1993) 132–158CrossRefMathSciNetGoogle Scholar
- 2.Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 25th ACM Symposium on Theory of Computing. (1993) 91–100Google Scholar
- 3.Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM 46 (1999) 858–923MATHCrossRefMathSciNetGoogle Scholar
- 4.Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing 29 (2000) 1449–1483MATHCrossRefMathSciNetGoogle Scholar
- 5.Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43 (1996) 225–267MATHCrossRefMathSciNetGoogle Scholar
- 6.Aumann, Y.: Efficient asynchronous consensus with the weak adversary scheduler. In: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, ACM Press (1997) 209–218Google Scholar
- 7.Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing. (1983) 27–30Google Scholar
- 8.Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. Journal of the ACM 33 (1986) 499–516CrossRefMathSciNetGoogle Scholar
- 9.Attiya, H., Rajsbaum, S.: The combinatorial structure of wait-free solvable tasks. In: Proceedings of the 10th International Workshop on Distributed Algorithms. Number 1151 in Lecture Notes in Computer Science, Springer-Verlag (1996) 321–343 Also Technical Report #CS0924, Department of Computer Science, Technion, December 1997.Google Scholar
- 10.Taubenfeld, G., Katz, S., Moran, S.: Impossibility results in the presense of multiple faulty porcesses. In: Information and Computation. (1994) 113(2):173–198MATHCrossRefMathSciNetGoogle Scholar
- 11.Taubenfeld, G., Moran, S.: Possibility and impossibility results in a shared memory environment. Acta Informatica 33 (1996) 1–20CrossRefMathSciNetGoogle Scholar
- 12.Friedman, R., Mostefaoui, A., Rajsbaum, S., Raynal, M.: Distributed agreement and its relation with error-correcting codes. (In: Proc. 16th Symposium on Distributed Computing (DISC’ 02), these proceedings)Google Scholar
- 13.Mostefaoui, A., Rajsbaum, S., Raynal, M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, ACM Press (2001) 153–162Google Scholar
- 14.Mostefaoui, A., Rajsbaum, S., Raynal, M., Roy, M.: Condition-based protocols for set agreement problems. (In: Proc. 16th Symposium on Distributed Computing (DISC’ 02), these proceedings)Google Scholar
- 15.Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing. (1993) 41–52Google Scholar
- 16.Munkres, J.: Elements of algebraic topology. Addison-Wesley, Menlo Park CA (1984)MATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2002