Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
Weak-consistency group communication and membership
Weak-consistency group communication and membership
Oracle's symmetric replication technology and implications for application design
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Perspectives on optimistically replicated, peer-to-peer filing
Software—Practice & Experience
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
Understanding the Behavior of the Conflict-Rate Metric in Optimistic Peer Replication
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Probabilistic Modelling of Replica Divergence
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Replicated document management in a group communication system
CSCW '88 Proceedings of the 1988 ACM conference on Computer-supported cooperative work
Design and evaluation of a continuous consistency model for replicated services
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
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
Flexible and safe resolution of file conflicts
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Hi-index | 0.00 |
Optimistic replication provides high data availability in the presence of network outages. Although widely deployed, this relaXed consistency model introduces concurrent updates, whose behavior is poorly understood due to the vast state space. This paper introduces the notion of permuted states to eliminate system states that are redundant and unreachable, which can constitute the majority of states (4069 out of 4096 for four replicas). With the aid of permuted states, we are for the first time able to construct analytical models beyond the two-replica case. By eXamining the analysis for 2 to 4 replicas, we can demystify the process of forming identical conflicts—the most common conflict type at high replication factors. Additionally, we have automated and optimized the generation of permuted states, which allows us to eXplore higher replication factors (up to 10 replicas) using hybrid techniques. It also allows us to validate our results with eXisting simulations based on actual replication mechanisms, which previously were analytically validated with only one pair of replicas. Finally, we have discovered that update locality and bimodal access patterns are the primary factors contributing to the formation of identical conflicts.