Replicated abstract data types: Building blocks for collaborative applications

doi:10.1016/j.jpdc.2010.12.006

Replicated abstract data types: Building blocks for collaborative applications

2011-03-01

71

PRE

AI

DOI：10.1016/j.jpdc.2010.12.006

原文链接

原文求助

摘要

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.

Keyword:

Distributed data structures

Optimistic replication

Replicated abstract data types

Optimistic algorithm

Collaboration

Replicated abstract data types: Building blocks for collaborative applications

摘要

AI总结

期刊

机构