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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00120734
Contributor : Pierre Sutra <>
Submitted on : Monday, October 8, 2007 - 1:56:07 PM
Last modification on : Wednesday, June 12, 2019 - 1:34:54 AM
Long-term archiving on : Thursday, September 23, 2010 - 4:19:36 PM

Files

squelette-rr.pdf
Files produced by the author(s)

Identifiers

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

Citation

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⟩

Share

Metrics

Record views

498

Files downloads

482