Weakening failure detectors for k-set agreement via the partition approach

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

Volumn 4731 LNCS, Issue , 2007, Pages 123-138

  Chen, Wei ^a   Zhang, Jialin ^b   Chen, Yu ^a   Liu, Xuezheng ^a  

^a MICROSOFT RESEARCH ASIA   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Failure detector; k set agreement; Partitioned failure detectors

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

FAILURE DETECTORS; PARTITIONED FAILURE DETECTORS;

MESSAGE PASSING;

EID: 38049077532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_12     Document Type: Conference Paper

References (21)

1. Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 91-100. ACM Press, New York (1993)
2. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685-722 (1996)
3. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225-267 (1996)
4. Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation 105(1), 132-158 (1993)
5. Chen, W., Chen, Y., Zhang, J.: On failure detectors weaker than ever. Technical Report TR-2007-50, Microsoft Research (May 2007)
6. Chen, W., Zhang, J., Chen, Y., Liu, X.: Failure detectors and extended Paxos for k-set agreement. Technical Report TR-2007-48, Microsoft Research (May 2007)
7. Chen, W., Zhang, J., Chen, Y., Liu, X.: Partition approach to failure detectors for k-set agreement. Technical Report TR-2007-49, Microsoft Research (May 2007)
8. 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: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, pp. 338-346. ACM Press, New York (2004)
9. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374-382 (1985)
10. Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N., Newport, C.: On the weakest failure detector ever. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing. ACM Press, New York (2007)
11. Herlihy, M., Penso, L.D.: Tight bounds for k-set agreement with limited scope accuracy failure detectors. Distributed Computing 18(2), 157-166 (2005)
12. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM 46(6), 858-923 (1999)
13. Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst. 12(3), 463-492 (1990)
14. Jayanti, P.: Robust wait-free hierarchies. J. ACM 44(4), 592-614 (1997)
15. Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems 16(2), 133-169 (1998)
16. Mostefaoui, A., Rajsbaum, S., Raynal, M.: 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, pp. 179-188. ACM Press, New York (2005)
17. Mostefaoui, A., Rajsbaum, S., Raynal, M., Travers, C.: Irreducibility and additivity of set agreement-oriented failure detector classes. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 153-162. ACM Press, New York (2006)
18. Mostefaoui, A., Raynal, M.: k-set agreement with limited accuracy failure detectors. In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, pp. 143-152. ACM Press, New York (2000)
19. Raynal, M., Travers, C.: In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement (Invited talk). In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 1-17. Springer, Heidelberg (2006)
20. 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)
21. Yang, J., Neiger, G., Gafni, E.: Structured derivations of consensus algorithms for failure detectors. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, pp. 297-306. ACM Press, New York (1998)