Fast access to distributed atomic memory

SIAM Journal on Computing

Volumn 39, Issue 8, 2010, Pages 3752-3783

  Dutta, Partha ^a   Guerraoui, Rachid ^b   Levy, Ron R ^c   Vukolić, Marko ^d  

^a IBM INDIA RESEARCH LAB   (India)

^b EPFL   (Switzerland)

^c Chemin des Vieux Saules 3   (Switzerland)

^d EURECOM   (France)

Author keywords

Atomic registers; Byzantine failures; Distributed algorithms; Fault tolerance; Shared memory emulations; Time complexity

Indexed keywords

ATOMIC REGISTER; BYZANTINE FAILURES; DISTRIBUTED ALGORITHMS; SHARED MEMORIES; TIME-COMPLEXITY;

ALGORITHMS; ATOMS; DATA STRUCTURES; FAULT TOLERANCE; MESSAGE PASSING;

QUALITY ASSURANCE;

EID: 78751497843     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090757010     Document Type: Article

References (30)

1. M. ABD-EL-MALEK, W. V. COURTRIGHT II, C. CRANOR, G. R. GANGER, J. HENDRICKS, A. J. KLOSTERMAN, M. MESNIER, M. PRASAD, B. SALMON, R. R. SAMBASIVAN, S. SINNAMOHIDEEN, J. D. STRUNK, E. THERESKA, M. WACHS, AND J. J. WYLIE, Ursa minor: Versatile cluster-based storage, in Proceedings of the 4th USENIX Conference on File and Storage Technologies, 2005, pp. 59-72.
2. I. ABRAHAM, G. V. CHOCKLER, I. KEIDAR, AND D. MALKHI, Byzantine disk Paxos: Optimal resilience with Byzantine shared memory, Distrib. Comput., 18 (2006), pp. 387-408.
3. A. S. AIYER, L. ALVISI, AND R. A. BAZZI, Bounded wait-free implementation of optimally resilient Byzantine storage without (unproven) cryptographic assumptions, in Proceedings of the 21st International Symposium on Distributed Computing, 2007, pp. 7-19.
4. H. ATTIYA, A. BAR-NOY, AND D. DOLEV, Sharing memory robustly in message-passing systems. J. ACM, 42 (1995), pp. 124-142.
5. H. ATTIYA AND J. WELCH, Distributed Computing. Fundamentals, Simulations, and Advanced Topics, McGraw-Hill, New York, 1998.
6. C. CACHIN AND S. TESSARO, Optimal resilience for erasure-coded Byzantine distributed storage, in Proceedings of the International Conference on Dependable Systems and Networks, 2006, pp. 115-124.
7. B.-G. CHUN, F. DABEK, A. HAEBERLEN, E. SIT, H. WEATHERSPOON, M. F. KAASHOEK, J. KUBIATOWICZ, AND R. MORRIS, Efficient replica maintenance for distributed storage systems, in Proceedings of the 3rd Conference on Networked Systems Design and Implementation, 2006, pp. 45-58.
8. P. DUTTA, R. GUERRAOUI, R. R. LEVY, AND A. CHAKRABORTY, How fast can a distributed atomic read be?, in Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, 2004, pp. 236-245.
9. B. ENGLERT, C. GEORGIOU, P. M. MUSIAL, N. C. NICOLAOU, AND A. A. SHVARTSMAN, On the efficiency of atomic multi-reader, multi-writer distributed memory, in Proceedings of the 13th International Conference on Principles of Distributed Systems, 2009, pp. 240-254.
10. B. ENGLERT AND A. A. SHVARTSMAN, Graceful quorum reconfiguration in a robust emulation of shared memory, in Proceedings of the 20th International Conference on Distributed Computing Systems, 2000, pp. 454-463.
11. R. FAN AND N. LYNCH, Efficient replication of large data objects, in Proceedings of the 17th International Symposium on Distributed Computing, 2003, pp. 75-91.
12. C. GEORGIOU, N. C. NICOLAOU, AND A. A. SHVARTSMAN, On the robustness of (semi) fast quorum-based implementations of atomic shared memory, in Proceedings of the 22nd International Symposium on Distributed Computing, 2008, pp. 289-304.
13. C. GEORGIOU, N. C. NICOLAOU, AND A. A. SHVARTSMAN, Fault-tolerant semifast implementations of atomic read/write registers, J. Parallel Distrib. Comput., 69 (2009), pp. 62-79.
14. R. GUERRAOUI, R. R. LEVY, AND M. VUKOLIĆ, Lucky read/write access to robust atomic storage, in Proceedings of the International Conference on Dependable Systems and Networks, 2006, pp. 125-136.
15. R. GUERRAOUI AND M. VUKOLIĆ, Refined quorum systems, Distrib. Comput., 23 (2010), pp. 1-42.
16. M. HERLIHY, Wait-free synchronization, ACM Trans. Programming Languages Syst., 13 (1991), pp. 124-149.
17. P. JAYANTI, T. D. CHANDRA, AND S. TOUEG, Fault-tolerant wait-free shared objects, J. ACM, 45 (1998), pp. 451-500.
18. L. LAMPORT, On interprocess communication, Distrib. Comput., 1 (1986), pp. 77-101.
19. L. LAMPORT, Lower bounds for asynchronous consensus, in Future Directions in Distributed Computing, 2003, pp. 22-23.
20. N. LYNCH AND A. SHVARTSMAN, Robust emulation of shared memory using dynamic quorumacknowledged broadcasts, in Proceedings of the 27th Annual International Symposium on Fault-Tolerant Computing, 1997, pp. 272-281.
21. N. A. LYNCH, Distributed Algorithms, Morgan Kaufmann, San Francisco, CA, 1996.
22. N. A. LYNCH AND M. R. TUTTLE, An introduction to input/output automata, CWI Quart., 2 (1989), pp. 219-246.
23. N. A. LYNCH AND A. A. SHVARTSMAN, Rambo: A reconfigurable atomic memory service for dynamic networks, in Proceedings of the 16th International Conference on Distributed Computing, 2002, pp. 173-190.
24. D. MALKHI AND M. K. REITER, Secure and scalable replication in phalanx, in Proceedings of the 17th Symposium on Reliable Distributed Systems, 1998, pp. 51-58.
25. J.-P. MARTIN, L. ALVISI, AND M. DAHLIN, Minimal Byzantine storage, in Proceedings of the 16th International Conference on Distributed Computing, 2002, pp. 311-325.
26. M. PEASE, R. SHOSTAK, AND L. LAMPORT, Reaching agreements in the presence of faults, J. ACM, 27 (1980), pp. 228-234.
27. M. O. RABIN, Efficient dispersal of information for security, load balancing, and fault tolerance, J. ACM, 36 (1989), pp. 335-348.
28. R. L. RIVEST, A. SHAMIR, AND L. M. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), pp. 120-126.
29. Y. SAITO, S. FROLUND, A. VEITCH, A. MERCHANT, AND S. SPENCE, FAB: Building distributed enterprise disk arrays from commodity components, SIGOPS Oper. Syst. Rev., 38 (2004), pp. 48-58.
30. F. SCHMUCK AND R. HASKIN, GPFS: A shared-disk file system for large computing clusters, in Proceedings of the 1st USENIX Conference on File and Storage Technologies, 2002, pp. 231-244.