| Autor: |
Delporte-Gallet, Carole, Fauconnier, Hugues, Guerraoui, Rachid, Tielmann, Andreas |
| Zdroj: |
Distributed Computing (9783540877783); 2008, p109-120, 12p |
| Abstrakt: |
In the set-agreement problem, n processes seek to agree on at most n − 1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, called the Loneliness detector and denoted ]> , outputs one of two values, ˵true″ or ˵false″ such that: (1) there is at least one process where ]> outputs always ˵false″, and (2) if only one process is correct, ]> eventually outputs ˵true″ at this process. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
