Decentralised Commitment for Optimistic Semantic Replication

  • Pierre Sutra
  • João Barreto
  • Marc Shapiro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4803)

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/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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Pierre Sutra
    • 1
  • João Barreto
    • 2
  • Marc Shapiro
    • 1
  1. 1.Université Paris VI and INRIA RocquencourtFrance
  2. 2.INESC-ID and Instituto Superior Técnico, LisbonPortugal

Personalised recommendations