Byzantine disk paxos: Optimal resilience with byzantine shared memory

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 226-235

  Abraham, Ittai ^a   Keidar, Idit ^b   Chockler, Gregory V ^c   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Byzantine failures; Consensus; Shared memory emulations; Termination conditions

Indexed keywords

FINITE WRITES (FW); MEMORY STRUCTURES; STORAGE MANAGEMENT;

ALGORITHMS; COMPUTER OPERATING SYSTEMS; DATA STRUCTURES; INFORMATION RETRIEVAL; SERVERS;

NETWORK PROTOCOLS;

EID: 10444273150     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared objects. Journal of the ACM, 42(6):1231-1274, November 1995.
2. Y. Afek, M. Merritt, and G. Taubenfeld. Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69-83. Springer Verlag, September 1993. In: LNCS 725.
3. H. Attiya and A. Bar-Or. Sharing memory with semi-Byzantine clients and faulty storage servers. In SRDS, 2003.
4. R. Bazzi. Synchronous Byzantine Quorum Systems. Distributed Computing, 13(1):45-52, 2000.
5. R. Boichat, P. Dutta, S. Frolund, and R. Guerraoui. Deconstructing Paxos. Distributed computing column of the ACM SIGACT News, 34(1):47-67, 2003.
6. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824-840, October 1985.
7. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685-722, 1996.
8. G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), 2002.
9. G. Chockler, D. Malkhi, and M. K. Reiter. Backoff protocols for distributed mutual exclusion and ordering. In Proceedings of the 21st International Conference on Distributed Computing Systems, pages 11-20, 2001.
10. F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems, pages 642-657, June 1999.
11. C. Delporte, H. Fauconnier, and R. Guerraoui. Failure detection lower bounds on registers and consensus. In Proceedings of the 16th International Symposium on Distributed Computing (DISC), October 2002.
12. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2):288-323, Apr. 1988.
13. E. Gafni and L. Lamport. Disk Paxos. Distributed Computing, 16(1):1-20, 2003.
14. J. A. Garay, R. Gennaro, C. Jutla, and T. Rabin. Secure distributed storage and retrieval. Theoretical Computer Science, 243(1-2):363-389, 2000.
15. S. Haldar and P. Vitanyi. Bounded concurrent timestamp systems using vector clocks. J. ACM, 49(1):101-126, 2002.
16. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), page 522. IEEE Computer Society, 2003.
17. P. Jayanti, T. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, 1998.
18. S. Lakshmanan, M. Ahamad, and H. Venkateswaran. Responsive security for stored data. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS), 2003.
19. L. Lamport. On interprocess communication - part ii: Algorithms. Distributed Computing, 1(2):86-101, 1986.
20. L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2): 133-169, 1998.
21. E. K. Lee and C. Thekkath. Petal: Distributed virtual disks. In Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), pages 84-92, 1996.
22. W. K. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), pages 280-295. Springer-Verlag, 1994. In: LNCS 857.
23. N. A. Lynch and M. Tuttle. An introduction to Input/Output Automata. CWI Quarterly, 2(3):219-246, 1989.
24. D. Malkhi and M. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering, 12(2): 187-202, 2000.
25. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In Proceedings of the 16th International Symposium on Distributed Computing (DISC), October 2002.
26. R. Rodrigues and B. Liskov. Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture. Technical Report MIT-LCS-TR-932, MIT Laboratory for Computer Science, 2004.
27. S. Lin, Q. Lian, M. Chen, and Z. Zhang A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems. In 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04), 2004.
28. C. Thekkath, T. Mann, and E. K. Lee. Frangipani: A scalable distributed file system. In proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 224-237, 1997.
29. L. Zhou, F. B. Schneider, and R. van Renesse. Coca: A secure distributed on-line certification authority. ACM Transactions on Computer Systems, 20(4):329-368, 2002.