论文信息 - On the hardness of failure-sensitive agreement problems

On the hardness of failure-sensitive agreement problems

Chandra and Toueg [J. ACM 43 (2) (1996)], Fromentin et al. [Proc. IEEE Internat. Conf. on Distrib. Comput., 1999] and Sabel and Marzullo [Tech. Rept. TR95-1488, Cornell Univ., 1995], respectively, stated that the weakest failure detector for any of non-blocking atomic commit, terminating reliable broadcast and leader election is the Perfect failure detector P. This paper presents a counterexample of those results. We exhibit a failure detector that is incomparable to P, and yet solves those problems.

Rachid Guerraoui

[1] Keith Marzullo,et al. Election Vs. Consensus in Asynchronous Systems , 1995 .

[2] Sam Toueg,et al. The weakest failure detector for solving consensus , 1992, PODC '92.

[3] Chun Zhang,et al. Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[4] Sam Toueg,et al. Fault-tolerant broadcasts and related problems , 1993 .

[5] Dale Skeen,et al. Nonblocking commit protocols , 1981, SIGMOD '81.

[6] Michel Raynal,et al. On classes of problems in asynchronous distributed systems with process crashes , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[7] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.