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
Type de document :
Communication dans un congrès
Symp. on Principles of Dist. Comp. (PODC), 2001, Newport, RI, United States. ACM Press, 2001, 〈10.1145/383962.384020〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01248215
Contributeur : Alain Monteil <>
Soumis le : jeudi 24 décembre 2015 - 09:43:28
Dernière modification le : mardi 5 janvier 2016 - 01:04:57

Fichier

podc2001.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. ACM Press, 2001, 〈10.1145/383962.384020〉. 〈hal-01248215〉

Partager

Métriques

Consultations de la notice

33

Téléchargements de fichiers

74