Decentralised Commitment for Optimistic Semantic Replication - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Decentralised Commitment for Optimistic Semantic Replication


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/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
sutra-barreto-shapiro-coopis40.pdf (203.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00444783 , version 1 (07-01-2010)



Pierre Sutra, Joao Barreto, Marc Shapiro. Decentralised Commitment for Optimistic Semantic Replication. International Conference on Cooperative Information Systems (CoopIS), Nov 2007, Vilamoura, Algarve, Portugal. pp.318-335, ⟨10.1007/978-3-540-76848-7_21⟩. ⟨inria-00444783⟩
149 View
168 Download



Gmail Facebook Twitter LinkedIn More