Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Discarding Obsolete Information in a Replicated Database System
IEEE Transactions on Software Engineering - Special issue on distributed systems
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Version Stamps " Decentralized Version Vectors
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Publius: a robust, tamper-evident, censorship-resistant web publishing system
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Resolving file conflicts in the Ficus file system
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
Improving causality logging in mobile computing networks
ACM SIGMOBILE Mobile Computing and Communications Review
Log-Structured Storage for Efficient Weakly-Connected Replication
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
ACM Computing Surveys (CSUR)
Version vectors based synchronization engine for mobile devices
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Models and software model checking of a distributed file replication system
Formal methods and hybrid real-time systems
Data synchronization architectural pattern for ubiquitous learning systems
Programming Support Innovations for Emerging Distributed Applications
Agreeing to agree: conflict resolution for optimistically replicated data
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Managing distributed collaboration in a peer-to-peer network
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Authenticating operation-based history in collaborative systems
Proceedings of the 17th ACM international conference on Supporting group work
| Hi-index | 0.00 |
We introduce the hash history mechanism for capturingdependencies among distributed replicas. Hash histories,consisting of a directed graph of version hashes, are independentof the number of active nodes but dependent onthe rate and number of modifications. We present the basichash history scheme and discuss mechanisms for trimmingthe history over time. We simulate the efficacy of hash historieson several large CVS traces. Our results highlighta useful property of the hash history: the ability to recognizewhen two different non-commutative operations producethe same output, thereby reducing false conflicts andincreasing the rate of convergence. We call these events coincidentalequalities and demonstrate that their recognitioncan greatly reduce the time to global convergence.