Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2015: Automata, Languages, and Programming pp 247–259Cite as

From Sequential Specifications to Eventual Consistency

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9135))

Abstract

We address a fundamental issue of interfaces that arises in the context of cloud computing. We define what it means for a replicated and distributed implementation satisfy the standard sequential specification of the data structure. Several extant implementations of replicated data structures already satisfy the constraints of our definition. We describe how the algorithms discussed in a recent survey of convergent or commutative replicated datatypes [17] satisfy our definition. We show that our definition simplifies the programmer task significantly for a class of clients who conform to the CALM principle [10].

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bouajjani, A., Enea, C., Hamza, J.: Verifying eventual consistency of optimistic replication systems. In POPL 2014, pp. 285–296 (2014)

    Google Scholar 

  2. Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: POPL 2014, pp. 271–284 (2014)

    Google Scholar 

  3. Burckhardt, S., Leijen, D., Fähndrich, M., Sagiv, M.: Eventually consistent transactions. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol. 7211, pp. 67–86. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Conway, N., Marczak, W.R. et al.: Logic and lattices for distributed programming. In: ACM Symposium on Cloud Computing, pp. 1:1–1:14 (2012)

    Google Scholar 

  5. Derrick, J., Dongol, B., et al.: Quiescent consistency: defining and verifying relaxed linearizability. In: Formal, Methods, pp. 200–214 (2014)

    Google Scholar 

  6. Ellis, C.A., Gibbs, S.J.: Concurrency control in groupware systems. ACM SIGMOD Record 18(2), 399–407 (1989)

    Article  Google Scholar 

  7. Filipovic, I., O’Hearn, P.W., Rinetzky, N., Yang, H.: Abstraction for concurrent objects. Theoretical Comp. Sci. 411, 4379–4398 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, pp. 51–59 (2002)

    Google Scholar 

  9. Gotsman, A., Yang, H.: Composite replicated data types. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 585–609. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  10. Hellerstein, J.M.: The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Rec. 39(1), 5–19 (2010)

    Article  Google Scholar 

  11. Herlihy, M., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM TOPLAS 12(3), 463–492 (1990)

    Article  Google Scholar 

  12. Jagadeesan, R., Riely, J.: Between linearizability and quiescent consistency. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 220–231. Springer, Heidelberg (2014)

    Google Scholar 

  13. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  14. Panangaden, P., Shanbhogue, V., Stark, E.W.: Stability and sequentiality in dataflow networks. In: ICALP 1990, pp. 308–321 (1990)

    Google Scholar 

  15. Panangaden, P., Stark, E.W.: Computations, residuals, and the power of indeterminacy. In: ICALP 1988, pp. 439–454 (1988)

    Google Scholar 

  16. Saito, Y., Shapiro, M.: Optimistic replication. Comput. Surv. 37(1), 42–81 (2005)

    Article  Google Scholar 

  17. Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: A comprehensive study of Convergent and Commutative Replicated Data Types. TR 7506, Inria (2011)

    Google Scholar 

  18. Terry, D.B., Theimer, M.M. et al.: Managing update conflicts in bayou, a weakly connected replicated storage system. In: SOSP (1995)

    Google Scholar 

  19. Vogels, W.: Eventually consistent. Communications of the ACM 52(1), 40–44 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DePaul University, Chicago, USA

    Radha Jagadeesan & James Riely

Authors
  1. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James Riely
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to James Riely .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jagadeesan, R., Riely, J. (2015). From Sequential Specifications to Eventual Consistency. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47666-6_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47665-9

  • Online ISBN: 978-3-662-47666-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation