Brief Announcement: Semantics of Eventually Consistent Replicated Sets
Résumé
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.
Domaines
Autre [cs.OH]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...