Sharing is harder than agreeing

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 85-94

  Delporte Gallet, Carole ^a   Fauconnier, Hugues ^a   Guerraoui, Rachid ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b EPFL   (Switzerland)

Author keywords

Asynchronous system; Failure detector; K set agreement; Message passing; Register

Indexed keywords

ABSTRACTING; COMPUTATION THEORY;

ASYNCHRONOUS SYSTEM; FAILURE DETECTORS; FAILURE INFORMATION; MESSAGE PASSING SYSTEMS; PHYSICAL DEVICES; REGISTER; SET-AGREEMENT; SHARED MEMORY REGISTERS;

MESSAGE PASSING;

EID: 57549092059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400764     Document Type: Conference Paper

References (22)

1. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message passing systems. J. ACM, 42(2):124-142, Jan. 1995.
2. H. Attiya and J. Welch. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998.
3. E. Boroswsky 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.
4. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685-722, July 1996.
5. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225-267, Mar. 1996.
6. S. Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1):132-158, 1993.
7. W. Chen, J. Zhang, Y. Chen, and X. Liu. Weakening failure detectors for fc-set agreement via the approach. In Proceedings of Distributed Computing, volume 4731 of Lecture Notes in Computer Science, pages 123-138, Sept. 2007.
8. C. Delporte-Gallet, H. Fauconnier, and R. Guerraoui. Shared memory vs message passing. Technical Report 200377, EPFL Lausanne, 2003.
9. C. Delporte-Gallet, H. Fauconnier, and R. Guerraoui. (almost) all objects are universal in message passing systems. In Proceedings of Distributed Computing, volume 3724 of Lecture Notes in Computer Science, pages 184-198, Sept. 2005.
10. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Koutnetzov, and S. Toueg. The weakest failure detectors to solve certain fundamental problems in distributed computing. In Proceedings of the 23th ACM Symposium on Principles of Distributed Computing, pages 338-346, July 2004.
11. E. Gafni, M. Raynal, and C. Travers. Test & set, adaptive renaming and set agreement: a guided visit to asynchronous computability. In Proceedings of IEEE Symposium on Reliable Distributed Systems, pages 93-102, Oct. 2007.
12. R. Guerraoui, M. Herlihy, P. Kouznetsov, N. A. Lynch, and C. C. Newport. On the weakest failure detector ever. In Proceedings of the 26th ACM Symposium on Principles of Distributed Computing, pages 235-243, Aug. 2007.
13. M. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings of the 25th A CM Symposium on Theory of Computing, pages 111-120, May 1993.
14. M. P. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):123-149, Jan. 1991.
15. L. Lamport. On interprocess communication; part I and II. Distributed Computing, 1(2):77-101, 1986.
16. L. Lamport. On interprocess communication; part I: Basic formalism. Distributed Computing, 1(2):77-85, 1986.
17. A. Mostéfaoui, S. Rajsbaum, and M. Raynal. The combined power of conditions and failure detectors to solve asynchronous set agreement. In Proceedings of the 24th ACM Symposium on Principles of Distributed Computing, pages 179-188, July 2005.
18. A. Mostéfaoui, S. Rajsbaum, M. Raynal, and C. Travers. Irreducibility and additivity of set agreement-oriented failure detector classes. In Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, July 2006.
19. A. Mostéfaoui and M. Raynal. k-set agreement with limited accuracy failure detectors. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, pages 143-152, aug 2000.
20. G. Neiger. Failure detectors and the wait-free hierarchy. In Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, pages 100-109, Aug. 1995.
21. M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 101-110, May 1993.
22. P. Zieliński. Anti-Ω: the weakest failure detector for set agreement. Technical report, UCAM-CL-TR-694, 2007.