Tight bounds for k-set agreement with limited-scope failure detectors

Distributed Computing

Volumn 18, Issue 2, 2005, Pages 157-166

  Herlihy, M ^a   Penso, L D ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS MESSAGE-PASSING MODELS; FAILURE DETECTORS; TIGHT BOUNDS;

BOUNDARY CONDITIONS; FAILURE ANALYSIS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; TOPOLOGY;

SET THEORY;

EID: 27844444073     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0141-8     Document Type: Conference Paper

References (18)

1. Anceaume, E., Hurfin, M., Parvedy, P.R.: An efficient solution to the k-set agreement problem. Technical Report PI-1440, INRIA (2003)
2. Attiya, H., Avidor, Z.: Wait-free n-set consensus when inputs are restricted. In: Malkhi, D. (ed.) Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, vol. 2508 of Lecture Notes in Computer Science, pp. 326-338. Springer (2002)
3. Borowsky, E., Gafni, E.: Generalized flp impossibility result for t-resilient asynchronous computations. In: Proceedings of the 1993 ACM Symposium on Theory of Computing (1993)
4. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM (JACM) 43(4), 685-722 (1996)
5. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM (JACM) 43(2), 225-267 (1996)
6. Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: Proceedings of the Ninth Annual ACM Symosium on Principles of Distributed Computing, pp. 311-234 (1990)
7. Chaudhuri, S., Herlihy, M., Lynch, N.A., Tuttle, M.R.: Tight bounds for k-set agreement. Journal of the ACM (JACM) 47(5), 912-943(2000)
8. Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 143-152. ACM Press (1998)
9. Herlihy, M., Rajsbaum, S.: Algebraic spans. Mathematical Structures in Computer Science 10(4), 549-573 (2000). Special Issue: Geometry and Concurrency.
10. Herlihy, M., Rajsbaum, S., Tuttle, M.R.: Unifying synchronous and asynchronous message-passing models. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 133-142. ACM Press (1998)
11. Herlihy, M., Rajsbaum, S., Tuttle, M.R.: A new synchronous lower bound for set agreement. In: Proceedings of DISC 2001, pp. 136-150 (2001)
12. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM (JACM) 46(6), 858-923 (1999)
13. Mostéfaoui, A., Rajsbaum, S., Raynal, M., Roy, M.: Condition-based protocols for set agreement problems. In: Malkhi, D. (ed.) Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, vol. 2508 of Lecture Notes in Computer Science, pp. 48-62. Springer (2002)
14. Mostéfaoui, A., Raynal, M.: k-set agreement with limited accuracy failure detectors. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 143-152. ACM Press (2000)
15. Munkres, J.R.: Elements Of Algebraic Topology. Addison Wesley, Reading MA (1984) ISBN 0-201-04586-9.
16. 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)
17. Spanier, E.H.: Algebraic Topology. Springer-Verlag, New York (1966)
18. Yang, J., Neiger, G., Gafni, E.: Structured derivations of consensus algorithms for failure detectors. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 297-306. ACM Press (1998)