Replicated abstract data types: Building blocks for collaborative applications

  • Authors:
  • Hyun-Gul Roh;Myeongjae Jeon;Jin-Soo Kim;Joonwon Lee

  • Affiliations:
  • Department of Computer Science, KAIST, Daejeon, Republic of Korea;Department of Computer Science, Rice University, Houston, TX, United States;School of Information and Communication Engineering, Sungkyunkwan University (SKKU), Suwon, Republic of Korea;School of Information and Communication Engineering, Sungkyunkwan University (SKKU), Suwon, Republic of Korea

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.