Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems

  • Roberto Baldoni
  • Silvia Bonomi
  • Michel Raynal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6271)


This paper introduces a shared object, namely a set object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition suited to such an object is introduced. This condition, named value-based sequential consistency, is weaker than linearizability. The paper also addresses the construction of a set object in a synchronous anonymous distributed system where participants can continuously join and leave the system. Interestingly, the protocol is proved correct under the assumption that some constraint on the churn is satisfied. This shows that the notion of “provably correct software” can be applied to dynamic systems.


Churn Consistency condition Dynamic system Infinite arrival model Set object Synchronous system 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Delporte-Gallet, C., Fauconnier, H.: Two consensus algorithms with atomic registers and failure detector ω. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 251–262. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)CrossRefGoogle Scholar
  3. 3.
    Baldoni, R., Bonomi, S., Raynal, M.: Regular Register: an Implementation in a Churn Prone Environment. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 15–29. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Schiper, A., Raynal, M., Raynal, M.: A suite of formal definitions for consistency criteria in distributed shared memories. In: ISCA Proceedings of the International Conference PDCS, Dijon, France, pp. 125–130 (1996)Google Scholar
  5. 5.
    Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transaction on Computers (TC) 28(9), 690–691 (1979)CrossRefMATHGoogle Scholar
  6. 6.
    Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: Definitions, implementation, and programming. Distributed Computing 9(1), 37–49 (1995)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Ko, S.Y., Hoque, I., Gupta, I.: Using tractable and realistic churn models to analyze quiescence behavior of distributed protocols. In: SRDS 2008: Proceedings of the 2008 Symposium on Reliable Distributed Systems, Washington, DC, USA, pp. 259–268. IEEE Computer Society, Los Alamitos (2008)CrossRefGoogle Scholar
  8. 8.
    Hadzilacos, V., Toueg, S.: Reliable broadcast and related problems. Distributed Systems, 97–145 (1993)Google Scholar
  9. 9.
    Friedman, R., Raynal, M., Travers, C.: Two abstractions for implementing atomic objects in dynamic systems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 73–87. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Baldoni, R., Bonomi, S., Raynal, M.: Value-based Sequential Consistency for Set Objects in Dynamic Distributed Systems. Technical report, MIDLAB 3/2010 (2010)Google Scholar
  11. 11.
    Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. Distributed Computing 35(2), 36–59 (2004)Google Scholar
  12. 12.
    Leonard, D., Rai, V., Loguinov, D.: On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. SIGMETRICS Perform. Eval. Rev. 33(1), 26–37 (2005)CrossRefGoogle Scholar
  13. 13.
    Lamport, L.: On interprocess communication, part 1: Models. Distributed Computing 1(2), 77–101 (1994)CrossRefMATHGoogle Scholar
  14. 14.
    Baldoni, R., Bonomi, S., Kermarrec, A.M., Raynal, M.: Implementing a Register in a Dynamic Distributed System. In: 29th International Conference on Distributed Computing Systems, ICDCS 2009 (2009)Google Scholar
  15. 15.
    Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A., Welch, J.: Geoquorum: Implementing atomic memory in ad hoc networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 306–320. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Roberto Baldoni
    • 1
  • Silvia Bonomi
    • 1
  • Michel Raynal
    • 2
  1. 1.Universitá La SapienzaRomaItaly
  2. 2.IRISAUniversité de RennesRennesFrance

Personalised recommendations