Efficient replication of large data objects

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

Volumn 2848, Issue , 2003, Pages 75-91

  Fan, Rui ^a   Lynch, Nancy ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; LOCKS (FASTENERS); MESSAGE PASSING;

DATA REPLICATION; DISTRIBUTED DATA; DISTRIBUTED LOCKING; GROUP COMMUNICATIONS; LOCATION INFORMATION; READ OPERATION; REPLICATION ALGORITHM; SPACE COMPLEXITY;

ALGORITHMS;

EID: 35248876689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_6     Document Type: Article

References (18)

1. A. Adya, W. Bolosky, M. Castro, and G. Cermak et al. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the fifth symposium on operating systems design and implementation, 2002.
2. Y. Amir, D. Dolev, P. Melliar-Smith, and L. Moser. Robust and efficient replication using group communication, 1994.
3. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, January 1995.
4. P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley Longman Publishing Co., Inc., 1987.
5. Y. Breitbart and H. F. Korth. Replication and consistency: being lazy helps sometimes. In Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 173-184. ACM Press, 1997.
6. R. Fan. Efficient replication of large data-objects. Technical Report MIT-LCS-TR-886, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA 02139, February 2003.
7. David K. Gifford. Weighted voting for replicated data. In Proceedings of the seventh symposium on Operating systems principles, pages 150-162, 1979.
8. J. Gray, P. Helland, P. O'Neil, and D. Shasha. The dangers of replication and a solution. In Proceedings of the 1996 ACM SIGMOD international conference on Management of data, pages 173-182. ACM Press, 1996.
9. J. Welch H. Attiya. Distributed Computing. McGraw Hill International, Ltd., 1998.
10. M. P. Herlihy and J. M. Wing. Axioms for concurrent objects, pages 13-26. ACM Press, 1987.
11. Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
12. R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat. Providing high availability using lazy replication. ACM Transactions on Computer Systems, 10(4):360-391, 1992.
13. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Mateo, CA, March 1996.
14. N. Lynch and A. Shvartsman. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS'97), pages 272-281, Seattle, Washington, USA, June 1997. IEEE.
15. E. Pacitti, P. Minet, and E. Simon. Fast algorithms for maintaining replica consistency in lazy master replicated databases. In VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pages 126-137. Morgan Kaufmann, 1999.
16. J.-F. Paris. Voting with witnesses:: A consistency scheme for replicated files. In Proceedings of the 6th International Conference on Distributed Computing Systems (ICDCS), pages 606-612, Washington, DC, 1986. IEEE Computer Society.
17. K. Petersen and K. Li. An evaluation of multiprocessor cache coherence based on virtual memory support. In Proc. of the 8th Int'l Parallel Processing Symp. (IPPS'94), pages 158-164, 1994.
18. R. van Renesse and A. S. Tanenbaum. Voting with ghosts. In Proceedings of the 8th International Conference on Distributed Computing Systems (ICDCS), pages 456-462, Washington, DC, 1988. IEEE Computer Society.