The IceCube approach to the reconciliation of divergent replicas

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 : rep optim syn
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248215
Contributor : Alain Monteil <>
Submitted on : Thursday, December 24, 2015 - 9:43:28 AM
Last modification on : Tuesday, January 5, 2016 - 1:04:57 AM

File

podc2001.pdf
Files produced by the author(s)

Identifiers

Citation

Anne-Marie Kermarrec, Antony Rowstron, Marc Shapiro, Peter Druschel. The IceCube approach to the reconciliation of divergent replicas. Symp. on Principles of Dist. Comp. (PODC), 2001, Newport, RI, United States. ⟨10.1145/383962.384020⟩. ⟨hal-01248215⟩

Share

Metrics

Record views

68

Files downloads

164