A note on set agreement with omission failures

Electronic Notes in Theoretical Computer Science

Volumn 81, Issue , 2003, Pages 48-58

  Guerraoui, Rachid ^a   Kouznetsov, Petr ^a   Pochon, Bastian ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; LINEAR ALGEBRA; PROBLEM SOLVING; THEOREM PROVING; TOPOLOGY;

ALGEBRAIC TOPOLOGY; FAULTY PROCESS; SUBSETS; SYNCHRONOUS MODELS;

SET THEORY;

EID: 18944367359     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80835-1     Document Type: Conference Paper

References (12)

1. Afek Y., Attiya H., Dolev D., Gafni E., Merrit M., Shavit N. Atomic snapshots of shared memory. Journal of the ACM. 40:(4):September 1993;873-890
2. E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 91-100, May 1993.
3. Chandra T.D., Toueg S. Unreliable failure detectors for reliable distributed systems. Journal of the ACM. 43:(2):March 1996;225-267
4. S. Chaudhuri. Agreement is harder than consensus: set consensus in totally asynchronous systems. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing (PODC), pages 311-324, August 1990.
5. Chaudhuri S., Herlihy M., Lynch N.A., Tuttle M.R. Tight bounds for k-set agreement. Journal of the ACM. 47:(5):2000;912-943
6. C. Delporte-Gallet and H. Fauconnier. Latency measures and lower bounds for consensus with failure detectors. In Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002), Andros, 2000.
7. Fischer M.J., Lynch N.A., Paterson M.S. Impossibility of distributed consensus with one faulty process. Journal of the ACM. 32:(3):April 1985;374-382
8. E. Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), pages 143-152, June 1998.
9. M. Herlihy, S. Rajsbaum, and M. R. Tuttle. Unifying synchronous and asynchronous message-passing models. In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), pages 133-142, June 1998.
10. Herlihy M., Shavit N. The topological structure of asynchronous computability. Journal of the ACM. 46:(6):November 1999;858-923
11. Munkres J.R. Elements of Algebraic Topology. 1984;Addison-Wesley, Menlo Park, Calif
12. N. Santoro and P. Widmayer. Time is not a healer. In Proceedings of the 6th Annual Symp. Theor. Aspects of Computer Science, volume 349 of LNCS, pages 304-313, Padernorn, Germany, February 1989. Springer Verlag.