Brief Announcement: Semantics of Eventually Consistent Replicated Sets

Abstract : This paper studies the semantics of sets under eventual consistency. Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency (e.g., linearisability). The sequential semantics of a set are well known, and are defined by in- dividual updates, e.g., {true}add(e){e ∈ S} (in "{pre-condition} computation {post-condition}" notation), where S denotes its abstract state. However, the semantics of concurrent modifications is left underspecified or implementation- driven.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-00769554
Contributor : Marc Shapiro <>
Submitted on : Wednesday, January 2, 2013 - 11:27:40 AM
Last modification on : Thursday, March 21, 2019 - 12:58:55 PM
Long-term archiving on : Wednesday, April 3, 2013 - 3:47:50 AM

File

semantics-sets-BA-DISC-2012.pd...
Files produced by the author(s)

Identifiers

Citation

Annette Bieniusa, Marek Zawirski, Nuno Preguiça, Marc Shapiro, Carlos Baquero, et al.. Brief Announcement: Semantics of Eventually Consistent Replicated Sets. DISC 2012 - 26th International Symposium on Distributed Computing, Oct 2012, Salvador, Bahia, Brazil. pp.441--442, ⟨10.1007/978-3-642-33651-5_48⟩. ⟨hal-00769554⟩

Share

Metrics

Record views

704

Files downloads

236