The Part-Time Parliament

ACM Transactions on Computer Systems

Volumn 16, Issue 2, 1998, Pages 133-169

  Lamport, Leslie ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

Design; Reliability; State machines; Three phase commit; Voting

Indexed keywords

DESIGN; DISTRIBUTED COMPUTER SYSTEMS; RELIABILITY;

STATE MACHINES;

NETWORK PROTOCOLS;

EID: 0032058184     PISSN: 07342071     EISSN: None     Source Type: Journal    
DOI: 10.1145/279227.279229     Document Type: Article

References (15)

1. BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
2. DE PRISCO, R., LAMPSON, B., AND LYNCH, N. 1997. Revisiting the Paxos algorithm. In Proceedings of the 11th International Workshop on Distributed Algorithms, M. Mavronicolas and P. Tsigas, Eds., Lecture Notes in Computer Science, vol. 1320. Springer-Verlag, Berlin, Germany, 111-125.
3. DIJKSTRA, E. W. 1974. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11, 643-644.
4. DWORK, C., LYNCH, N., AND STOCKMEYER, L. 1988. Consensus in the presence of partial synchrony. J. ACM 35, 2 (Apr.), 288-323.
5. FEKETE, A., LYNCH, N., AND SHVARTSMAN, A. 1997. Specifying and using a partitionable group communication service. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing. ACM Press, New York, NY, 53-62.
6. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 1 (Jan.), 374-382.
7. GRAY, C. AND CHERITON, D. 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. SIGOPS Oper. Syst. Rev. 23, 5 (Dec. 3-6), 202-210.
8. KEIDAR, I. AND DOLEV, D. 1996. Efficient message ordering in dynamic networks. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing. ACM Press, New York, NY.
9. LADIN, R., LISKOV, B., SHRIRA, L., AND GHEMAWAT, S. 1992. Providing high availability using lazy replication. ACM Trans. Comput. Syst. 10, 4 (Nov.), 360-391.
10. LAMPORT, L. 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7, 558-565.
11. LAMPORT, L. 1984. Using time instead of timeout for fault-tolerant distributed systems. ACM Trans. Program. Lang. Syst. 6, 2 (Apr.), 254-280.
12. LAMPSON, B. W. 1996. How to build a highly available system using consensus. In Distributed Algorithms, O. Babaoglu and K. Marzullo, Eds. Springer Lecture Notes in Computer Science, vol. 1151. Springer-Verlag, Berlin, Germany, 1-17.
13. OKI, B. M. AND LISKOV, B. H. 1988. Viewstamped replication: A general primary copy. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (Toronto, Ontario, August 15-17, 1988). ACM Press, New York, NY, 8-17.
14. SCHNEIDER, F. B. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 22, 4 (Dec.), 299-319.
15. SKEEN, M. D. 1982. Crash recovery in a distributed database system. Ph.D. thesis. University of California at Berkeley, Berkeley, CA.