The IceCube approach to the reconciliation of divergent replicas
- 1 August 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 210-218
- https://doi.org/10.1145/383962.384020
Abstract
We describe a novel approach to log-based reconciliation called IceCube. It is general and is parameterised by application and object semantics. IceCube considers more flexible orderings and is designed to ease the burden of reconciliation on the application programmers. IceCube captures the static and dynamic reconciliation constraints between all pairs of actions, proposes schedules that satisfy the static constraints, and validates them against the dynamic constraints.Preliminary experience indicates that strong static constraints successfully contain the potential combinatorial explosion of the simulation stage. With weaker static constraints, the system still finds good solutions in a reasonable time.Keywords
This publication has 8 references indexed in Scilit:
- Operational transformation in real-time group editorsPublished by Association for Computing Machinery (ACM) ,1998
- What is a file synchronizer?Published by Association for Computing Machinery (ACM) ,1998
- Supporting autonomous work and reintegration in collaborative systemsPublished by Springer Nature ,1998
- Flexible update propagation for weakly consistent replicationPublished by Association for Computing Machinery (ACM) ,1997
- Designing and implementing asynchronous collaborative applications with BayouPublished by Association for Computing Machinery (ACM) ,1997
- Apologizing versus asking permission: optimistic concurrency control for abstract data typesACM Transactions on Database Systems, 1990
- Synchronizing shared abstract typesACM Transactions on Computer Systems, 1984
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981