The Part-Time Parliament

Leslie Lamport, 1998, ACM TOCS

About this paperEnglishTiếng Việt日本語beside Englishbeside Tiếng Việtbeside 日本語

This paper is under a licence that does not allow it to be reproduced, so what is here is its front matter and a short abstract. Read it at the publisher's page.

兼职议会

Leslie Lamport

本文发表于《ACM Transactions on Computer Systems》16，2（1998年5月），133-169页。2000年8月29日进行了小幅修正。

兼职议会

LESLIE LAMPORT Digital Equipment Corporation

最近在帕克索斯岛上的考古发现表明，尽管其兼职立法者四处奔波，议会仍然能够正常运作。尽管立法者经常离开议事厅，并且他们的信使经常遗忘信息，他们仍维护了议会记录的一致副本。帕克索斯议会的协议为设计分布式系统时实现状态机方法提供了一种新方式。类别和主题描述：C2.4［计算机通信网络］：分布式系统——网络操作系统；D4.5［操作系统］：可靠性——容错；J.1［行政数据处理］：政府 通用术语：设计，可靠性 其他关键词和短语：状态机，三阶段提交，投票

这篇投稿最近在TOCS编辑部的一个文件柜后面被发现。尽管它年代久远，主编仍认为它值得发表。由于作者目前正在希腊群岛进行实地考察，无法联系到他，我被要求为其出版做准备。

作者似乎是一名考古学家，对计算机科学只有浅显的兴趣。这很遗憾；尽管他所描述的鲜为人知的古代帕克索斯文明对大多数计算机科学家而言并无太大兴趣，但其立法系统是如何在异步环境中实现分布式计算机系统的一个优秀模型。

References

  1. Bernstein, P. A., Hadzilacos, V., and Goodman, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, Massachusetts. De Prisco, R., Lampson, B., and Lynch, N. 1997. Revisiting the Paxos algorithm. In
  2. M. Mavronicolas and P. Tsigas (Eds.), Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97), Volume 1320 of Lecture Notes in Computer
  3. Science, Saarbruken, Germany, pp. 111–125. Springer-Verlag. Dijkstra, E. W. 1974. Self-stabilizing systems in spite of distributed control. Commun.
  4. ACM 17, 11 (Nov.), 643–644. Dwork, C., Lynch, N., and Stockmeyer, L. 1988. Consensus in the presence of partial synchrony. Journal of the ACM 35, 2 (April), 288–323. Fekete, A., Lynch, N., and Shvartsman, A. 1997. Specifying and using a partitionable group communication service. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 53–62. ACM Press. Fischer, M. J., Lynch, N., and Paterson, M. S. 1985. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32, 2 (April), 374–382. Gray, C. G. and Cheriton, D. R. 1989. Leases: An efficient fault-toerant mechanism for distributed file cache consistency. In Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, New York, pp. 202–210. ACM. Keidar, I. and Dolev, D. 1996. Efficient message ordering in dynamic networks. In Proceedings of the 15 th Annual ACM Symposium on Principles of Distributed Computing. ACM.
  5. Ladin, R., Liskov, B., Shrira, L., and Ghemawat, S. 1992. Providing high availability using lazy replication. ACM Transactions on Computer Systems 10, 4 (Nov.), 360–391. Lamport, L. 1978. Time, clocks, and the ordering of events in a distributed system. Commun.
  6. ACM 21, 7 (July), 558–565. Lamport, L. 1984. Using time instead of timeout for fault-tolerant distributed systems. ACM
  7. Trans. on Programm. Lang. Syst. 6, 2 (April), 254–280. Lampson, B. W. 1996. How to build a highly available system using consensus. In O. Babaoglu and K. Marzullo (Eds.), Distributed Algorithms, Volume 1151 of Lecture Notes in Computer Science, Berlin, pp. 1–17. Springer-Verlag. Oki, B. M. and Liskov, B. H. 1988. Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, pp. 8–17. ACM Press. Schneider, F. B. 1990. Implementing fault-tolerant services using the state machine approach:
  8. A tutorial. ACM Computing Surveys 22, 4 (Dec.), 299–319. Skeen, M. D. 1982. Crash recovery in a distributed database system. Ph. D. thesis, University of California, Berkeley.
  9. Received January 1990; Accepted March 1998

Read off the page by the text layer of the PDF using pdftotext version 26.09.0. Translated into 中文 by gpt-5, against glossary version 6. Translated from the English.