Brief Announcement: Semantics of Eventually Consistent Replicated Sets

Sérgio Marco Duarte, Nuno Manuel Ribeiro Preguiça

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)


This paper studies the semantics of sets under eventual consistency. The set is a pervasive data type, used either directly or as a component of more complex data types, such as maps or graphs. Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency (e.g., linearisability). Accordingly, several cloud computing platforms implement eventually-consistent replicated sets [2,4].
Original languageUnknown
Title of host publicationLecture Notes in Computer Science
Publication statusPublished - 1 Jan 2012
Event26th International Symposium on Distributed Computing, DISC 2012 -
Duration: 1 Jan 2012 → …


Conference26th International Symposium on Distributed Computing, DISC 2012
Period1/01/12 → …

Cite this