| Citation key |
DFGK-MEASFD-05 |
| Author |
Delporte-Gallet, Carole and Fauconnier, Hugues and Guerraoui, Rachid and Kouznetsov, Petr |
| Pages |
492–505 |
| Year |
2005 |
| ISSN |
0743-7315 |
| DOI |
http://dx.doi.org/10.1016/j.jpdc.2004.11.008 |
| Journal |
Journal of Parallel and Distributed Computing (JPDC) |
| Volume |
65 |
| Number |
4 |
| Month |
April |
| Abstract |
This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. This failure detector, which we call the trusting failure detector, and which we denote by T, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ◊P. The paper shows that a majority of correct processes is necessary to solve the problem with T. Moreover, T is also the weakest failure detector to solve the fault-tolerant group mutual exclusion problem, given a majority of correct processes. |
