Revisiting the Paxos algorithm (1997)
Cached
Download Links
- [www.toc.lcs.mit.edu]
- [theory.lcs.mit.edu]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Marios Mavronicolas and Philippas Tsigas, editors, Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97), volume 1320 of Lecture Notes in Computer Science |
| Citations: | 46 - 3 self |
BibTeX
@INPROCEEDINGS{Prisco97revisitingthe,
author = {Roberto De Prisco and Butler Lampson},
title = {Revisiting the Paxos algorithm},
booktitle = {In Marios Mavronicolas and Philippas Tsigas, editors, Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97), volume 1320 of Lecture Notes in Computer Science},
year = {1997},
pages = {111--125},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper develops a new I/O automaton model called the Clock General Timed Automaton (Clock GTA) model. The Clock GTA is based on the General Timed Automaton (GTA) of Lynch and Vaandrager. The Clock GTA provides a systematic way of describing timingbased systems in which there is a notion of "normal" timing behavior, but that do not necessarily always exhibit this "normal" behavior. It can be used for practical time performance analysis based on the stabilization of the physical system. We use the Clock GTA automaton to model, verify and analyze the paxos algorithm. The paxos algorithm is an efficient and highly faulttolerant algorithm, devised by Lamport, for reaching consensus in a distributed system. Although it appears to be practical, it is not widely known or understood. This paper contains a new presentation of the paxos algorithm, based on a formal decomposition into several interacting components. It also contains a correctness proof and a time performance and fault-tole...
