کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
431585 | 688591 | 2011 | 15 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Replicated abstract data types: Building blocks for collaborative applications Replicated abstract data types: Building blocks for collaborative applications](/preview/png/431585.png)
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.
Research highlights
► We propose three RADTs as building blocks of collaborative applications.
► Precedence transitivity can achieve consistency of RADTs by ensuring commutativity.
► RGAs provide insertion, deletion, and update operations working in O(1) at remote sites.
► RGAs show significant improvement in complexity, scalability, and reliability.
Journal: Journal of Parallel and Distributed Computing - Volume 71, Issue 3, March 2011, Pages 354–368