The disagreement power of an adversary

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 288-289

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

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b EPFL   (Switzerland)

Author keywords

Adversaries; Failure detectors; Fault tolerance

Indexed keywords

ADVERSARIES; DISTRIBUTED COMPUTING; EXTREME CASE; FAILURE DETECTORS; K-VALUES; N-CLASS; SET-AGREEMENT; SHARED MEMORY MODEL;

COMPUTER SCIENCE; DETECTORS; FAULT TOLERANCE; QUALITY ASSURANCE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 70350680786     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582769     Document Type: Conference Paper

References (15)

1. A. F. Anta, S. Rajsbaum, and C. Travers. Weakest failure detectors via an egg-laying simulation (preliminary version). Tech Report 2, Systems and Communications, Jan. 2009. Also appears as a brief announcement in PODC 2009.
2. E. Borowsky and E. Gafni. Generalized flp impossibility result for t-resilient asynchronous computations. In STOC, pages 91-100, 1993.
3. E. Borowsky, E. Gafni, N. A. Lynch, and S. Rajsbaum. The BG distributed simulation algorithm. Distributed Computing, 14(3):127-146, 2001.
4. A. B.V, A. Patra, A. Choudhary, K. Srinathan, and C. Pandu Rangan. On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. In PODC, pages 115-124, 2008.
5. T. D. Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus. SIAM J. Comput., 34(2):333-357, 2004.
6. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. In PODC, pages 147-158, 1992.
7. M. Fitzi and U. M. Maurer. Efficient byzantine agreement secure against general adversaries. In DISC, pages 134-148, 1998.
8. E. Gafni and P. Kuznetsov. The weakest failure detector for solving k-set agreement. In PODC, 2009.
9. R. Guerraoui, M. Herlihy, P. Kouznetsov, N. A. Lynch, and C. C. Newport. On the weakest failure detector ever. In PODC, pages 235-243, 2007.
10. M. Herlihy and S. Rajsbaum. The decidability of distributed decision tasks (extended abstract). In STOC, pages 589-598, 1997.
11. M. Herlihy and N. Shavit. The topological structure of asynchronous computability. J. ACM, 46(6):858-923, 1999.
12. F. P. Junqueira and K. Marzullo. Designing algorithms for dependent process failures. In Future Directions in Distributed Computing, pages 24-28, 2003.
13. W.-K. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems (extended abstract). In WDAG, pages 280-295, 1994.
14. M. E. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput., 29(5):1449-1483, 2000.
15. P. Zielinski. Anti-Omega: the weakest failure detector for set agreement. In PODC, pages 55-64, 2008.