Looking for the weakest failure detector for k-set agreement in message-passing systems: Is Πk the end of the road?

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

Volumn 5873 LNCS, Issue , 2009, Pages 149-164

  Bonnet, François ^a   Raynal, Michel ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS SYSTEM; EVENTUAL LEADER; EXTREME CASE; FAILURE DETECTORS; K-SET AGREEMENT PROBLEMS; MESSAGE PASSING SYSTEMS; PROCESS CRASH; SET-AGREEMENT; SHARED MEMORY SYSTEM;

DETECTORS; NETWORK SECURITY; STABILIZATION;

MESSAGE PASSING;

EID: 70549103402     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05118-0_11     Document Type: Conference Paper

References (29)

1. Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: Simultaneous consensus tasks: A tighter characterization of set-consensus. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 331-341. Springer, Heidelberg (2006)
2. k the End of the Road? Tech. Report #1929, 19 pages, IRISA, Université de Rennes 1 (France) (May 2009)
3. Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computation (STOC 1993), San Diego, CA, pp. 91-100 (1993)
4. Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225-267 (1996)
5. Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685-722 (1996)
6. Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105, 132-158 (1993)
7. Chaudhuri, S., Herlihy, M., Lynch, N., Tuttle, M.: Tight Bounds for k-Set Agreement. Journal of the ACM 47(5), 912-943 (2000)
8. Chen, W., Zhang, J., Chen, Y., Liu, X.: Weakening failure detectors for k-set agreement via the partition approach. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 123-138. Springer, Heidelberg (2007)
9. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Sharing is harder than agreeing. In: 27th ACM Symp. on Princ. of Distributed Computing (PODC 2008), pp. 85-94. ACM Press, New York (2008)
10. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared Memory vs Message Passing. Technical Report2003-77, EPFL Lausanne (2003)
11. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 338-346. ACM Press, New York (2004)
12. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The Weakest Failure Detector for Message Passing Set-Agreement. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 109-120. Springer, Heidelberg (2008)
13. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC 2009). ACM Press, New York (2009)
14. Fernandez Anta, A., Rajsbaum, S., Travers, C.: Weakest failure detectors with an edge-laying simulation. In: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC 2009). ACM Press, New York (2009)
15. Gafni, E., Kuznetzov, P.: The weakest failure detector for solving k-set agreeemnt. In: Proc. 28th ACM Symp. on Principles of Distributed Computing (PODC 2009). ACM Press, New York (2009)
16. Guerraoui, R., Kouznetsov, P.: Failure detectors as types boosters. Distributed Computing 20, 343-358 (2008)
17. Herlihy, M.P., Penso, L.D.: Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Distributed Computing 18(2), 157-166 (2005)
18. Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6), 858-923 (1999)
19. Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 280-295. Springer, Heidelberg (1994)
20. Manabe, Y., Baldoni, R., Raynal, M., Aoyagia, S.: K-arbiter: a safe and general scheme for h-out of-k mutual exclusion. Theoretical Computer Science 193(1-2), 97-112 (1998)
21. Mostéfaoui, A., Rajsbaum, S., Raynal, M., Travers, C.: On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes. Distributed Computing 21(3), 201-222 (2008)
22. Mostéfaoui, A., Raynal, M.: k-Set Agreement with Limited Accuracy Failure Detectors. In: 19th ACM Symp. on Principles of Distributed Computing (PODC 2000), pp. 143-152 (2000)
23. Mostéfaoui, A., Raynal, M.: Randomized Set Agreement. In: Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pp. 291-297. ACM Press, New York (2001)
24. Neiger, G.: Failure Detectors and the Wait-free Hierarchy. In: 14th ACM Symposium on Principles of Distributed Computing (PODC 1995), pp. 100-109. ACM Press, New York (1995)
25. Raynal, M., Travers, C.: In search of the holy grail: looking for the weakest failure detector for wait-free set agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 3-19. Springer, Heidelberg (2006)
26. Raynal, M., Travers, C.: Synchronous Set Agreement: a concise guided tour (including a new algorithm and a list of open problems). In: Proc. 12th IEEE Pacific Rim Int'l Symposium on Dependable Computing (PRDC 2006), pp. 267-274. IEEE Computer Press, Los Alamitos (2006)
27. Raynal, M.: K-anti-Omega. In: Rump Session at 26th ACM Symposium on Principles of Distributed Computing, PODC 2007 (2007)
28. Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing 29(5), 1449-1483 (2000)
29. Zielinski, P.: Anti-Omega: the weakest failure detector for set agreement. In: Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC 2008), pp. 55-64. ACM Press, New York (2008)