An asynchronous, decentralised commitment protocol for semantic optimistic replication - Inria - Institut national de recherche en sciences et technologies du numérique
Rapport (Rapport De Recherche) Année : 2006

An asynchronous, decentralised commitment protocol for semantic optimistic replication

Résumé

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.
Fichier principal
Vignette du fichier
squelette-rr.pdf (201.63 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00120734 , version 1 (18-12-2006)
inria-00120734 , version 2 (19-12-2006)
inria-00120734 , version 3 (08-10-2007)

Identifiants

Citer

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⟩
405 Consultations
348 Téléchargements

Altmetric

Partager

More