RAMBO: A reconfigurable atomic memory service for dynamic networks

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

Volumn 2508, Issue , 2002, Pages 173-190

  Lynch, Nancy ^a   Shvartsman, Alex A ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARBITRARY PATTERNS; DYNAMIC NETWORK; MESSAGE DELAY; PERFORMANCE PROPERTIES; RECONFIGURABLE; RECONFIGURABLE ATOMIC MEMORY SERVICES; SHARED OBJECTS; WRITE OPERATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947256658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36108-1_12     Document Type: Conference Paper

References (21)

1. Communications of the ACM, special section on group communications, vol. 39, no. 4, 1996.
2. Y. Amir, D. Dolev, P. Melliar-Smith and L. Moser, “Robust and Efficient Replication Using Group Communication” Tech. Rep. 94-20, Dept. of Computer Science, Hebrew Univ., 1994.
3. H. Attiya, A. Bar-Noy and D. Dolev, “Sharing Memory Robustly in Message Passing Systems", J. of the ACM, vol. 42, no. 1, pp. 124-142, 1996.
4. P.A. Bernstein, V. Hadzilacos and N. Goodman, “Concurrency Control and Recovery in Database Systems”, Addison-Wesley, Reading, MA, 1987.
5. F. Cristian and F. Schmuck, “Agreeing on Processor Group Membership in Asynchronous Distributed Systems”, TR. CSE95-428, Dept. of Comp. Sci., Univ. of California San Diego.
6. S.B. Davidson, H. Garcia-Molina and D. Skeen, “Consistency in Partitioned Networks", ACM Computing Surveys, vol. 15, no. 3, pp. 341-370, 1985.
7. R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, “A Dynamic Primary Configuration Group Communication Service”, 13th Int-l Conference of Distributed Computing, 1999.
8. Roberto De Prisco, Nancy Lynch, Alex Shvartsman, Nicole Immorlica and Toh Ne Win “A Formal Treatment of Lamport’s Paxos Algorithm”, manuscript, 2002.
9. C. Dwork, N. A. Lynch, L. J. Stockmeyer, “Consensus in the presence of partial synchrony”, J. of ACM, 35(2), pp. 288-323, 1988.
10. B. Englert and A.A. Shvartsman, Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory, in Proc. International Conference on Distributed Computer Systems (ICDCS’2000), pp. 454-463, 2000.
11. A. Fekete, N. Lynch and A. Shvartsman “Specifying and using a partitionable group communication service”, ACM Trans. on Computer Systems, vol. 19, no. 2, pp. 171–216, 2001.
12. H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System," J. of the ACM, vol. 32, no. 4, pp. 841-860, 1985.
13. D.K. Gifford, “Weighted Voting for Replicated Data", in Proc. of 7th ACM Symp. on Oper. Sys. Princ., pp. 150-162, 1979.
14. M.P. Herlihy, “Dynamic Quorum Adjustment for Partitioned Data", ACMTrans. on Database Systems, 12(2), pp. 170-194, 1987.
15. R. Guerraoui and A. Schiper, “Consensus Service: A Modular Approach For Building Fault- Tolerant Agreement Protocols in Distributed Systems", Proc. of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pp. 168-177, 1996.
16. I. Keidar and D. Dolev, “Efficient Message Ordering in Dynamic Networks”, in Proc. of 15th Annual ACM Symp. on Princ. of Distr. Comput., pp. 68-76, 1996.
17. Leslie Lamport, "The Part-Time Parliament", ACMTransactions on Computer Systems, 16(2) 133-169, 1998.
18. N.A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1996.
19. N. Lynch and A. Shvartsman. Robust emulation of shared memory using dynamic quorumacknowledged broadcasts. 27th Int-l Symp. on Fault-Tolerant Comp., pp. 272-281, 1997.
20. Nancy Lynch and Alex Shvartsman. RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. MIT-LCS-TR-856, 2002
21. E. Upfal and A. Wigderson, How to share memory in a distributed system, Journal of the ACM, 34(1):116–127, 1987.