DMCA
Structured Derivations of Consensus Algorithms for Failure Detectors (1998)
| Venue: | In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing |
| Citations: | 31 - 3 self |
BibTeX
@INPROCEEDINGS{Yang98structuredderivations,
author = {Jiong Yang and Gil Neiger and Eli Gafni},
title = {Structured Derivations of Consensus Algorithms for Failure Detectors},
booktitle = {In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing},
year = {1998},
pages = {297--306},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In a seminal paper, Chandra and Toueg showed how unreliable failure detectors could allows processors to achieve consensus in asynchronous message passing systems. Since then, other researchers have developed consensus algorithms for other systems or based on different failure detectors. Each algorithm was developed and proven independently. This paper shows how a consensus algorithm for any of the standard models can be automatically converted to run in any other. These results show more clearly how the different system models and failure detectors can be related. In addition, they may permit the development of new results for new models also through transformations. 1 Introduction The problem of achieving consensus among processors in a distributed system is fundamental in distributed computing. Unfortunately, consensus cannot be achieved in the presence of failures in completely asynchronous systems, either those with message passing [8,9] or those with shared memory [7,8,12]. Thi...
Keyphrases
consensus algorithm failure detector structured derivation asynchronous system new result distributed computing asynchronous message shared memory unreliable failure detector consensus cannot seminal paper distributed system new model standard model different failure detector different system model
