The IceCube approach to the reconciliation of divergent replicas

  • Anne-Marie Kermarrec ,
  • Antony Rowstron ,
  • Marc Shapiro ,
  • Peter Druschel ,

20th Symp. on Principles of Dist. Comp. (PODC) |

Organized by ACM SIGACT-SIGOPS

\urlhttp://research.microsoft.com/research/camdis/Publis/podc2001.pdf

Download BibTex

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
exible
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 nds good solutions in a reasonable time.