Access the full text.
Sign up today, get DeepDyve free for 14 days.
Lev Novik, Irena Hudis, D. Terry, S. Anand, Vivek Jhaveri, Ashish Shah, Yuehua Wu (2006)
Peer-to-Peer Replication in WinFS
A. Arora, S. Kulkarni, M. Demirbas (2000)
Resettable vector clocks
M. Fischer, Alan Michael (1982)
Sacrificing serializability to attain high availability of data in an unreliable networkProceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
David Ratner, G. Popek, W. Chu (1998)
Roam: a scalable replication system for mobile and distributed computing
Yasushi Saito (2002)
Unilateral version vector pruning using loosely synchronized clocks
R. Ladin, B. Liskov, L. Shrira, S. Ghemawat (1992)
Providing high availability using lazy replicationACM Trans. Comput. Syst., 10
D. Parker, G. Popek, G. Rudisin, Alley Stoughton, Bruce Walker, Evelyn Walton, J. Chow, D. Edwards, S. Kiser, C. Kline (1983)
Detection of Mutual Inconsistency in Distributed SystemsIEEE Transactions on Software Engineering, SE-9
C. Fidge (1988)
Timestamps in Message-Passing Systems That Preserve the Partial Ordering
James Kistler, M. Satyanarayanan (1991)
Disconnected operation in the Coda file system
T. Page, Richard Guy, J. Heidemann, David Ratner, P. Reiher, Ashish Goel, G. Kuenning, G. Popek (1998)
Perspectives on optimistically replicated, peer‐to‐peer filingSoftware: Practice and Experience, 28
F. Torres-Rojas, M. Ahamad (1996)
Plausible clocks: constant size logical clocks for distributed systemsDistributed Computing, 12
R. Schwarz, F. Mattern (1994)
Detecting causal relationships in distributed computations: In search of the holy grailDistributed Computing, 7
D. Terry, M. Theimer, K. Petersen, A. Demers, M. Spreitzer, C. Hauser (1995)
Managing update conflicts in Bayou, a weakly connected replicated storage systemProceedings of the fifteenth ACM symposium on Operating systems principles
Yun-Wu Huang, Philip Yu (2000)
Lightweight version vectors for pervasive computing devicesProceedings 2000. International Workshop on Parallel Processing
David Ratner, P. Reiher, G. Popek (1999)
Roam: a scalable replication system for mobile computingProceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99
J. Almeida, Paulo Almeida, Carlos Baquero (2004)
Bounded Version Vectors
Conflicts naturally arise in optimistically replicated systems. The common way to detect update conflicts is via version vectors, whose storage and communication overhead are number of replicas × number of objects. These costs may be prohibitive for large systems. This paper presents predecessor vectors with exceptions (PVEs), a novel optimistic replication technique developed for Microsoft’s WinFS system. The paper contains a systematic study of PVE’s performance gains over traditional schemes. The results demonstrate a dramatic reduction of storage and communication overhead in normal scenarios, during which communication disruptions are infrequent. Moreover, they identify a cross-over threshold in communication failure-rate, beyond which PVEs loses efficiency compared with traditional schemes.
Distributed Computing – Springer Journals
Published: Sep 29, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.