Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Perspectives on optimistically replicated, peer-to-peer filing
Software—Practice & Experience
Roam: a scalable replication system for mobile and distributed computing
Roam: a scalable replication system for mobile and distributed computing
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
P2P replica synchronization with vector sets
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Perspective: semantic data management for the home
FAST '09 Proccedings of the 7th conference on File and storage technologies
PADS: a policy architecture for distributed storage systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Models and software model checking of a distributed file replication system
Formal methods and hybrid real-time systems
Design a cloud storage platform for pervasive computing environments
Cluster Computing
Agreeing to agree: conflict resolution for optimistically replicated data
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Orbe: scalable causal consistency using dependency matrices and physical clocks
Proceedings of the 4th annual Symposium on Cloud Computing
| Hi-index | 0.00 |
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.