.png){kind=icon}
Return
Replicated abstract data types: Building blocks for collaborative applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2010.12.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2010 Elsevier Inc. All rights reserved.
Keywords:
Distributed data structures
Optimistic replication
Replicated abstract data types
Optimistic algorithm
Collaboration
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more