Concise Version Vectors in WinFS

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.

[1]  Paulo Sérgio Almeida,et al.  Bounded Version Vectors , 2004, DISC.

[2]  Alley Stoughton,et al.  Detection of Mutual Inconsistency in Distributed Systems , 1983, IEEE Transactions on Software Engineering.

[3]  Michael J. Fischer,et al.  Sacrificing serializability to attain high availability of data in an unreliable network , 1982, PODS.

[4]  Peter Reiher,et al.  Perspectives on optimistically replicated, peer‐to‐peer filing , 1998 .

[5]  Mustaque Ahamad,et al.  Plausible clocks: constant size logical clocks for distributed systems , 1996, Distributed Computing.

[6]  Colin J. Fidge,et al.  Timestamps in Message-Passing Systems That Preserve the Partial Ordering , 1988 .

[7]  Peter L. Reiher,et al.  Roam: a scalable replication system for mobile computing , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.

[8]  F. Alajaji,et al.  c ○ Copyright by , 1998 .

[9]  Liuba Shrira,et al.  Providing high availability using lazy replication , 1992, TOCS.

[10]  Douglas B. Terry,et al.  Peer-to-Peer Replication in WinFS , 2006 .

[11]  Mahadev Satyanarayanan,et al.  Disconnected operation in the Coda File System , 1992, TOCS.

[12]  Marvin Theimer,et al.  Managing update conflicts in Bayou, a weakly connected replicated storage system , 1995, SOSP.

[13]  Friedemann Mattern,et al.  Detecting causal relationships in distributed computations: In search of the holy grail , 1994, Distributed Computing.

[14]  Philip S. Yu,et al.  Lightweight version vectors for pervasive computing devices , 2000, Proceedings 2000. International Workshop on Parallel Processing.

[15]  Murat Demirbas,et al.  Resettable vector clocks , 2000, PODC '00.