Implementing an eventually-serializable data service as a distributed system building block
Oleg M. Cheiner, Alexander A. Shvartsman · DIMACS series in discrete mathematics and theoretical computer science · 1998
This work presents an implementation of a distributed system building block that is formally speci ed as the Eventually-Serializable Data Service (ESDS) [7] proposed by Fekete et al. ESDS deals with replicated objects that allow the users of the service to relax consistency requirements in return for improved responsiveness, while providing guarantees of eventual consistency of the replicated data. The ESDS paper [7] includes a formal service speci cation and an abstract algorithm implementing the service. The algorithm is given in terms of I/O automata of Lynch and Tuttle [15]. An important consideration in formulating ESDS was that it could be employed in building real systems.