Decentralised Commitment for Optimistic Semantic Replication

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


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.


Semantic Relation Total Order Semantic Constraint Plurality Vote Optimistic Replication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barreto, J., Ferreira, P.: An efficient and fault-tolerant update commitment protocol for weakly connected replicas. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 1059–1068. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)Google Scholar
  3. 3.
    Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J.: Epidemic algorithms for replicated database maintenance. In: Symp. on Principles of Dist. Comp. (PODC), pp. 1–12, Vancouver, BC, Canada (August 1987). Also appears Op. Sys. Review 22(1), 8–32 (1988)Google Scholar
  4. 4.
    Fekete, A., Gupta, D., Luchangco, V., Lynch, N., Shvartsman, A.: Eventually-serializable data services. Theoretical Computer Science 220(Special issue on Distributed Algorithms), 113–156 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Holliday, J., Steinke, R., Agrawal, D., Abbadi, A.E.: Epidemic algorithms for replicated databases. IEEE Transactions on Knowledge and Data Engineering 15(5), 1218–1238 (2003)CrossRefGoogle Scholar
  6. 6.
    Ignat, C.-L., Norrie, M.C.: Draw-Together: Graphical editor for collaborative drawing. In: CSCW. Int. Conf. on Computer-Supported Cooperative Work, Banff, Alberta, Canada, pp. 269–278 (November 2006)Google Scholar
  7. 7.
    Johnson, P.R., Thomas, R.H.: The maintenance of duplicate databases. Internet Request for Comments RFC 677, Information Sciences Institute (January 1976)Google Scholar
  8. 8.
    Keleher, P.J.: Decentralized replicated-object protocols. In: Symp. on Principles of Dist. Comp. (PODC), Atlanta, GA, USA, pp. 143–151. ACM Press, New York (1999)Google Scholar
  9. 9.
    Kermarrec, A.-M., Rowstron, A., Shapiro, M., Druschel, P.: The IceCube approach to the reconciliation of divergent replicas. In: Symp. on Principles of Dist. Comp. (PODC), Newport, RI, USA ACM SIGACT-SIGOPS, ACM Press, New York (2001)Google Scholar
  10. 10.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)zbMATHCrossRefGoogle Scholar
  11. 11.
    Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems 16(2), 133–169 (1998)CrossRefGoogle Scholar
  12. 12.
    Lamport, L.: Generalized consensus and Paxos. Technical Report MSR-TR-2005-33, Microsoft Research (March 2005)Google Scholar
  13. 13.
    Pedone, F., Guerraoui, R., Schiper, A.: The database state machine approach. J. of Dist. and Parallel Databases and Technology 14(1), 71–98 (2003)CrossRefGoogle Scholar
  14. 14.
    Pedone, F., Schiper, A.: Handling message semantics with generic broadcast protocols. Distributed Computing Journal 15(2), 97–107 (2002)CrossRefGoogle Scholar
  15. 15.
    Preguiça, N., Shapiro, M., Matheson, C.: Semantics-based reconciliation for collaborative and mobile environments. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 38–55. Springer, Heidelberg (2003)Google Scholar
  16. 16.
    Ratner, D., Reiher, P., Popek, G.: Roam: A scalable replication system for mobile computing. In: Int. W. on Database & Expert Systems Apps (DEXA), pp. 96–104. IEEE Comp. Society, Los Alamitos, CA, USA (1999)Google Scholar
  17. 17.
    Saito, Y., Shapiro, M.: Optimistic replication. Computing Surveys 37(1), 42–81 (2005)CrossRefGoogle Scholar
  18. 18.
    Shapiro, M., Bhargavan, K.: The Actions-Constraints approach to replication: Definitions and proofs. Technical Report MSR-TR-2004-14, Microsoft Research (March 2004)Google Scholar
  19. 19.
    Sun, C., Jia, X., Zhang, Y., Yang, Y., Chen, D.: Achieving convergence, causality preservation, and intention preservation in real-time cooperative editing systems. Trans. on Comp.-Human Interaction 5(1), 63–108 (1998)CrossRefGoogle Scholar
  20. 20.
    Terry, D.B., Theimer, M.M., Petersen, K., Demers, A.J., Spreitzer, M.J., Hauser, C.H.: Managing update conflicts in Bayou, a weakly connected replicated storage system. In: 15th Symp. on Op. Sys. Principles (SOSP), Copper Mountain, CO, USA, pp. 172–182 ACM SIGACT-SIGOPS, ACM Press, New York (1995)Google Scholar

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