Parthenon

CS262a: Reading Assignment #19
Due Monday, October 30th


For Monday, read the following two papers:
  1. The Byzantine Generals Problem, Leslie Lamport, Robert Shostak, and Marshall Pease. Appears in ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 4, No. 3, July 1982, pp 382-401
  2. Practical Byzantine Fault Tolerance, M. Castro and B. Liskov. Appears In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), 1999.

You must also:

Submit a summary for these papers.


Optional Reading:

  1. SBFT: aScalable and Decentralized Trust Infrastructure, G. Golan Gueta et al., Appears in 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2019, pp. 568-580, doi: 10.1109/DSN.2019.00063.
  2. Attested Append-Only Memory: Making Adversaries Stick to their Word, Byung-Gon Chun, Petros Maniatis, Scott Shenker, and John Kubiatowicz..  Appears in 21st Symposium on Operating Systems Principles, October 2007
  3. Proactive recovery in a Byzantine-Fault-Tolerant system, M. Castro and B. Liskov. Appears in Proceedings of the Conference on Operating Systems Design and Implementation (OSDI), 2000.

Back to CS262a page


Maintained by John Kubatowicz (kubitron@cs.berkeley.edu). Last modified 10/23/2023