An asynchronous, decentralised commitment protocol for semantic optimistic replication

Abstract : We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include conflict, execution order, dependence, and atomicity. The local state is some schedule that conforms to the constraints; because of conflicts, client state is only tentative. For consistency, site schedules should converge; we designed a decentralised, asynchronous commitment protocol. Each client makes a proposal, reflecting its tentative and{\slash}or preferred schedules. Our protocol distributes the proposals, which it decomposes into semantically-meaningful units called candidates, and runs an election between comparable candidates. A candidate wins when it receives a majority or a plurality. The protocol is fully asynchronous: each site executes its tentative schedule independently, and determines locally when a candidate has won an election. The committed schedule is as close as possible to the preferences expressed by clients.
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger
Contributeur : Pierre Sutra <>
Soumis le : lundi 8 octobre 2007 - 13:56:07
Dernière modification le : mardi 17 avril 2018 - 11:28:48
Document(s) archivé(s) le : jeudi 23 septembre 2010 - 16:19:36


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00120734, version 3
  • ARXIV : cs/0612086



Pierre Sutra, Marc Shapiro, Joao Barreto. An asynchronous, decentralised commitment protocol for semantic optimistic replication. [Research Report] RR-6069, INRIA. 2006, pp.21. 〈inria-00120734v3〉



Consultations de la notice


Téléchargements de fichiers