Name
Abstract | ||
|---|---|---|
This paper presents a new algorithm implementing the Omega failure detector in the crash-recovery model. Contrary to previously proposed algorithms, this algorithm does not rely on the use of stable storage and is communication-efficient, i.e., eventually only one process (the elected leader) keeps sending messages. The algorithm relies on a nondecreasing local clock associated with each process. Since stable storage is not used to keep the identity of the leader in order to read it upon recovery, unstable processes, i.e., those that crash and recover infinitely often, output a special @? value upon recovery, and then agree with correct processes on the leader after receiving a first message from it. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ipl.2009.10.011 | Inf. Process. Lett. |
Keywords | Field | DocType |
crash-recovery model,unstable process,stable storage,communication-efficient omega algorithm,correct process,new algorithm,elected leader,nondecreasing local clock,omega failure detector,leader election,fault tolerant,distributed computing,failure detector,consensus,fault tolerance | Leader election,Crash,Failure detector,Information processing,Algorithm,Omega,Fault tolerance,Mathematics,Stable storage | Journal |
Volume | Issue | ISSN |
110 | 3 | 0020-0190 |
Citations | PageRank | References |
4 | 0.39 | 27 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristian Martín | 1 | 12 | 1.23 |
| Mikel Larrea | 2 | 267 | 30.10 |