52 lines
4.3 KiB
BibTeX
52 lines
4.3 KiB
BibTeX
@article{replicated_abstract_data_types,
|
||
title = {Replicated abstract data types: Building blocks for collaborative applications},
|
||
journal = {Journal of Parallel and Distributed Computing},
|
||
volume = {71},
|
||
number = {3},
|
||
pages = {354-368},
|
||
year = {2011},
|
||
issn = {0743-7315},
|
||
doi = {https://doi.org/10.1016/j.jpdc.2010.12.006},
|
||
url = {https://www.sciencedirect.com/science/article/pii/S0743731510002716},
|
||
author = {Hyun-Gul Roh and Myeongjae Jeon and Jin-Soo Kim and Joonwon Lee},
|
||
keywords = {Distributed data structures, Optimistic replication, Replicated abstract data types, Optimistic algorithm, Collaboration},
|
||
abstract = {For distributed applications requiring collaboration, responsive and transparent interactivity is highly desired. Though such interactivity can be achieved with optimistic replication, maintaining replica consistency is difficult. To support efficient implementations of collaborative applications, this paper extends a few representative abstract data types (ADTs), such as arrays, hash tables, and growable arrays (or linked lists), into replicated abstract data types (RADTs). In RADTs, a shared ADT is replicated and modified with optimistic operations. Operation commutativity and precedence transitivity are two principles enabling RADTs to maintain consistency despite different execution orders. Especially, replicated growable arrays (RGAs) support insertion/deletion/update operations. Over previous approaches to the optimistic insertion and deletion, RGAs show significant improvement in performance, scalability, and reliability.}
|
||
}
|
||
|
||
@article{verifying_strong_eventual_consistency,
|
||
author = {Gomes, Victor B. F. and Kleppmann, Martin and Mulligan, Dominic P. and Beresford, Alastair R.},
|
||
title = {Verifying strong eventual consistency in distributed systems},
|
||
year = {2017},
|
||
issue_date = {October 2017},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = {1},
|
||
number = {OOPSLA},
|
||
url = {https://doi.org/10.1145/3133933},
|
||
doi = {10.1145/3133933},
|
||
abstract = {Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still poorly understood. Indeed, many published algorithms have later been shown to be incorrect, even some that were accompanied by supposed mechanised proofs of correctness. In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We develop a modular and reusable framework in the Isabelle/HOL interactive proof assistant for verifying the correctness of CRDT algorithms. We avoid correctness issues that have dogged previous mechanised proofs in this area by including a network model in our formalisation, and proving that our theorems hold in all possible network behaviours. Our axiomatic network model is a standard abstraction that accurately reflects the behaviour of real-world computer networks. Moreover, we identify an abstract convergence theorem, a property of order relations, which provides a formal definition of strong eventual consistency. We then obtain the first machine-checked correctness theorems for three concrete CRDTs: the Replicated Growable Array, the Observed-Remove Set, and an Increment-Decrement Counter. We find that our framework is highly reusable, developing proofs of correctness for the latter two CRDTs in a few hours and with relatively little CRDT-specific code.},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
month = oct,
|
||
articleno = {109},
|
||
numpages = {28},
|
||
keywords = {verification, strong eventual consistency, replication, distributed systems, convergence, automated theorem proving, CRDTs}
|
||
}
|
||
|
||
@article{eventually_consistent,
|
||
author = {Vogels, Werner},
|
||
title = {Eventually consistent},
|
||
year = {2009},
|
||
issue_date = {January 2009},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = {52},
|
||
number = {1},
|
||
issn = {0001-0782},
|
||
url = {https://doi.org/10.1145/1435417.1435432},
|
||
doi = {10.1145/1435417.1435432},
|
||
abstract = {Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability.},
|
||
journal = {Commun. ACM},
|
||
month = jan,
|
||
pages = {40–44},
|
||
numpages = {5}
|
||
} |