The IceCube approach to the reconciliation of divergent replicas

  • Authors:
  • Anne-Marie Kermarrec;Antony Rowstron;Marc Shapiro;Peter Druschel

  • Affiliations:
  • Microsoft Research, Cambridge, UK;Microsoft Research, Cambridge, UK;Microsoft Research, Cambridge, UK;Rice Univ., Houston, TX

  • Venue:
  • Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.