On the robustness of (semi) fast quorum-based implementations of atomic shared memory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5218 LNCS, Issue , 2008, Pages 289-304

  Georgiou, Chryssis ^a   Nicolaou, Nicolas C ^b   Shvartsman, Alexander A ^b,c  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b University of Connecticut   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC PHYSICS; ATOMS; COMMERCE; FAULT TOLERANCE; MESSAGE PASSING; RELIABILITY;

ATOMIC REGISTERS; FAST READS; NETWORK SIMULATORS; QUORUM SYSTEMS; READ OPERATIONS; REALISTIC CONDITIONS; SHARED MEMORIES; TIME STAMPS; WRITE OPERATIONS;

QUALITY ASSURANCE;

EID: 56549114156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87779-0_20     Document Type: Conference Paper

References (23)

1. Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. Journal of the ACM 42(1), 124-142 (1996)
2. Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., Welch, J.: Geoquorums: Implementing atomic memory in mobile ad hoc networks. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), pp. 306-320 (2003)
3. Dutta, P., Guerraoui, R., Levy, R.R., Chakraborty, A.: How fast can a distributed atomic read be? In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 236-245 (2004)
4. Englert, B., Shvartsman, A.A.: Graceful quorum reconfiguration in a robust emulation of shared memory. In: Proceedings of 20th International Conference on Distributed Computing Systems (ICDCS), pp. 454-463 (2000)
5. Fan, R., Lynch, N.: Efficient replication of large data objects. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), pp. 75-91 (2003)
6. Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. Journal of the ACM 32(4), 841-860 (1985)
7. Georgiou, C., Musial, P.M., Shvartsman, A.A.: Developing a consistent domain-oriented distributed object service. In: Proceedings of the 4th IEEE International Symposium on Network Computing and Applications (NCA), pp. 149-158 (2005)
8. Georgiou, C., Musial, P.M., Shvartsman, A.A.: Long-lived RAMBO: Trading knowledge for communication. Theoretical Computer Science 383(1), 59-85 (2007)
9. Georgiou, C., Nicolaou, N., Shvartsman, A.: Fault-tolerant semifast implementations for atomic read/write registers. Journal of Parallel and Distributed Computing (accepted, 2008); A preliminary version appears in SPAA 2006, pp. 281-290 (2006)
10. Georgiou, C., Nicolaou, N., Shvartsman, A.: On the robustness of (semi) fast quorum-based implementations of atomic shared memory(2008), http://www.cse.uconn.edu/~ncn03001/pubs/TRs/GNS08.pdf
11. Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems Principles (SOSP), pp. 150-162 (1979)
12. Gilbert, S., Lynch, N., Shvartsman, A.: RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In: Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN), pp. 259-268 (2003)
13. Gramoli, V., Anceaume, E., Virgillito, A.: SQUARE: scalable quorum-based atomic memory with local reconfiguration. In: Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), pp. 574-579 (2007)
14. Guerraoui, R., Vukolić, M.: How fast can a very robust read be? In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 248-257 (2006)
15. Guerraoui, R., Vukolić, M.: Refined quorum systems. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC), pp. 119-128 (2007)
16. Lamport, L.: On interprocess communication, part I: Basic formalism. Distributed Computing 1(2), 77-85 (1986)
17. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
18. Lynch, N., Shvartsman, A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the 16th International Symposium on Distributed Computing (DISC), pp. 173-190(2002)
19. Lynch, N., Tuttle, M.: An introduction to input/output automata. CWI-Quarterly, 219-246 (1989)
20. Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS), pp. 272-281 (1997)
21. Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing 11(4), 203-213 (1998)
22. Peleg, D., Wool, A.: Crumbling walls: A class of high availability quorum systems. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing (PODC), pp. 120-129 (1995)
23. Shao, C., Pierce, E., Welch, J.L.: Multi-writer consistency conditions for shared memory objects. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), pp. 106-120 (2003)