Dynamic atomic storage without consensus

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 17-25

  Aguilera, Marcos K ^a   Keidar, Idit ^b   Malkhi, Dahlia ^a   Shraer, Alexander ^b  

^a MICROSOFT RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Atomic storage; Dynamic systems; Shared memory emulations

Indexed keywords

ASYNCHRONOUS SYSTEM; ATOMIC STORAGE; DYNAMIC SYSTEMS; FAULT-TOLERANT; MESSAGE PASSING SYSTEMS; SHARED-MEMORY EMULATIONS;

COMPUTER SCIENCE; DYNAMIC PROGRAMMING; DYNAMICAL SYSTEMS; MESSAGE PASSING;

ATOMS;

EID: 70350678824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582726     Document Type: Conference Paper

References (27)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, 1993.
2. M. K. Aguilera, I. Keidar, D. Malkhi, and A. Shraer. Dynamic atomic storage without consensus. Technical Report CCIT 731, Department of Electrical Engineering, Technion, 2009.
3. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. J. ACM, 42(1):124-142, 1995.
4. T. D. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost. On the impossibility of group membership. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC'96), pages 322-330, 1996.
5. G. Chockler, S. Gilbert, V. C. Gramoli, P. M. . Musial, and A. A. Shvartsman. Reconfigurable distributed storage for dynamic networks. In 9th International Conference on Principles of Distributed Systems (OPODIS), 2005.
6. G. Chockler, I. Keidar, and R. Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys, 33(4):1-43, 2001.
7. T. T. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press, Cambridge, MA, USA, 1990.
8. D. Davcev and W. Burkhard. Consistency and recovery control for replicated files. In 10th ACM SIGOPS Symposium on Operating Systems Principles (SOSP), pages 87-96, 1985.
9. C. Delporte, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetsov, and S. Toueg. The weakest failure detectors to solve certain fundamental problems in distributed computing. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2004), pages 338-346, 2004.
10. A. El Abbadi and S. Dani. A dynamic accessibility protocol for replicated databases. Data and Knowledge Engineering, 6:319-332, 1991.
11. B. Englert and A. A. Shvartsman. Graceful quorum reconfiguration in a robust emulation of shared memory. In ICDCS '00: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000), page 454, Washington, DC, USA, 2000. IEEE Computer Society.
12. S. Gilbert, N. Lynch, and A. Shvartsman. Rambo ii: Rapidly reconfigurable atomic memory for dynamic networks. In Proceedings of the 17th Intl. Symp. on Distributed Computing (DISC), pages 259-268, June 2003.
13. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
14. L. Lamport. On interprocess communication - part ii: Algorithms. Distributed Computing, 1(2):86-101, 1986.
15. L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133-169, May 1998.
16. L. Lamport, D. Malkhi, and L. Zhou. Brief announcement: Vertical paxos and primary-backup replication. In 28th ACM Symposium on Principles of Distributed Computing (PODC), August 2009. Full version appears as Microsoft Technical Report MSR-TR-2009-63, May 2009.
17. E. K. Lee and C. A. Thekkath. Petal: Distributed virtual disks. In Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, pages 84-92, Cambridge, MA, 1996.
18. N. Lynch and A. Shvartsman. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In In Symposium on Fault-Tolerant Computing, pages 272-281. IEEE, 1997.
19. N. A. Lynch and A. A. Shvartsman. RAMBO: A reconfigurable atomic memory service for dynamic networks. In 5th International Symposium on Distributed Computing (DISC), 2002.
20. J. MacCormick, N. Murphy, M. Najork, C. A. Thekkath, and L. Zhou. Boxwood: Abstractions as the foundation for storage infrastructure. In OSDI, pages 105-120, 2004.
21. J.-P. Martin and L. Alvisi. A framework for dynamic byzantine storage. In Proceedings of the International Conference on Dependable Systems and Networks, 2004.
22. J. Paris and D. Long. Efficient dynamic voting algorithms. In 13th International Conference on Very Large Data Bases (VLDB), pages 268-275, 1988.
23. R. Rodrigues and B. Liskov. Rosebud: A scalable byzantine-fault-tolerant storage architecture. Technical Report TR/932, MIT LCS, 2003.
24. R. Rodrigues and B. Liskov. Reconfigurable byzantine-fault-tolerant atomic memory. In Twenty-Third Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), St. John's, Newfoundland, Canada, July 2004. Brief Announcement.
25. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv., 22(4):299-319, 1990.
26. R. van Renesse and F. B. Schneider. Chain replication for supporting high throughput and availability. In Sixth Symposium on Operating Systems Design and Implementation (OSDI 04), December 2004.
27. E. Yeger Lotem, I. Keidar, and D. Dolev. Dynamic voting for consistent primary components. In 16th ACM Symposium on Principles of Distributed Computing (PODC), pages 63-71, August 1997.