Rui Fan  Home/Search
Context
Related
| mit.edu/tds/papers...Fanmsthesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/tds/reflist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Replication is an important technique for improving the reliability and scalability of data services. The primary problem encountered in replication is the trade-o between amount of replication, performance, and consistency. A rule of thumb states that any replication algorithm must sacri ce at least one of these criteria. In this thesis, we investigate replicating large data objects, such as les, whose size is large compared to metadata used by the replication algorithm. With this... (Update)
Active bibliography (related documents): More All
0.3: Efficient Replication of Large Data Objects - Fan, Lynch (2003) (Correct)
0.2: Are Quorums an Alternative - For Data Replication (2003) (Correct)
0.2: System Management In The Guide Distributed System - Duda, Cayuela (Correct)
Similar documents based on text: More All
0.1: Demand-based Coscheduling of Parallel Jobs on Multiprogrammed.. - Sobalvarro (1997) (Correct)
0.1: Automatic Acquisition of Language Models for Speech recognition - McCandless (1994) (Correct)
0.1: Building an Active Node on the Internet - Murphy (1997) (Correct)
BibTeX entry: (Update)
@misc{ fan-efficient,
author = "Rui Fan",
title = "Efficient Replication of Large Data Objects",
url = "citeseer.ist.psu.edu/article/fan03efficient.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
411 Freenet: A distributed anonymous information storage and ret.. - Clarke, Sandberg et al. - 2001
141 Byzantine quorum systems - Malkhi, Reiter - 1997
89 Providing high availability using lazy replication - Ladin, Liskov et al. - 1992
81 A principle for resilient sharing of distributed resources (context) - Alsberg, Day - 1976
79 A quorum-consensus replication method for abstract data type.. (context) - Herlihy - 1986
75 Concurrency control and recovery in database systems (context) - Bernstein, Hadzilacos et al. - 1987
69 Sharing memory robustly in message-passing systems (context) - Attiya, Bar-Noy et al. - 1995
52 Weighted voting for replicated data - Gi - 1979
49 Voting with witnesses:: A consistency scheme for replicated .. (context) - Paris - 1986
47 Principles of distributed database systems (context) - Ozsu, Valduriez - 1991
30 Managing update con icts in bayou (context) - Terry, Theimer et al. - 1995
29 Robust emulation of shared memory using dynamic quorum-ackno.. - Lynch, Shvartsman - 1997
13 and the practice of concurrency control and recovery (context) - Weikum, Vossen et al. - 2001
5 Voting with ghosts - van Renesse, Tanenbaum - 1988
Documents on the same site (http://toc.lcs.mit.edu/tds/reflist.html): More
Specifications and Proofs for Ensemble Layers - Hickey, Lynch, van Renesse (1999) (Correct)
I/O Automaton Models and Proofs for Shared-Key Communication Systems - Lynch (Correct)
Multicast Group Communication as a Base for a.. - Khazan, Fekete, Lynch (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC