Wait-free n-set consensus when inputs are restricted

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

Volumn 2508, Issue , 2002, Pages 326-338

  Attiya, Hagit ^a   Avidor, Zvi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CRASH FAILURES; IMPOSSIBILITY RESULTS; INPUT VALUES; K-SET CONSENSUS PROBLEM; READ/WRITE OPERATIONS; SET CONSENSUS; WAIT FREE; WRITE OPERATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947251883     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems.Information and Computation 103 (1993) 132-158
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-100
3. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM 46 (1999) 858-923
4. Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing 29 (2000) 1449-1483
5. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43 (1996) 225-267
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-218
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-30
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-516
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.
10. Taubenfeld, G., Katz, S., Moran, S.: Impossibility results in the presense of multiple faulty porcesses.In: Information and Computation. (1994) 113(2):173-198
11. Taubenfeld, G., Moran, S.: Possibility and impossibility results in a shared memory environment.Acta Informatica 33 (1996) 1-20
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)
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-162
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)
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-52
16. Munkres, J.: Elements of algebraic topology. Addison-Wesley, Menlo Park CA (1984)