|
Descripción
|
|
|---|---|
| Unreliable failure detectors are mechanisms providing information about process failures, that allow to solve several problems in asynchronous systems, e.g., Consensus. A particular failure detector, Omega, provides an eventual leader election functionality. This paper addresses the implementation of Omega in the crash-recovery failure model. We first propose an algorithm assuming that processes are reachable from the correct process that crashes and recovers a minimum number of times. Then, we propose two algorithms which assume only that processes are reachable from some correct process. Besides this, one of the algorithms requires the membership to be known a priori, while the other two do not. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
JOURNAL OF COMPUTER AND SYSTEM SCIENCES |
|
ISSN
|
0022-0000 |
|
Factor de impacto JCR
|
1,244 |
|
Información de impacto
|
|
|
Volumen
|
75 |
|
DOI
|
10.1016/j.jcss.2008.10.002 |
|
Número de revista
|
3 |
|
Desde la página
|
178 |
|
Hasta la página
|
189 |
|
Mes
|
MAYO |
|
Ranking
|
|