Replicated abstract data types: Building blocks for collaborative applications

Cited 29 time in webofscience Cited 0 time in scopus
  • Hit : 461
  • Download : 0
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.
Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
Issue Date
2011-03
Language
English
Article Type
Article
Keywords

CONCURRENCY-CONTROL; ALGORITHM; COMMUTATIVITY; CAUSAL; TIME

Citation

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.71, no.3, pp.354 - 368

ISSN
0743-7315
DOI
10.1016/j.jpdc.2010.12.006
URI
http://hdl.handle.net/10203/94500
Appears in Collection
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 29 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0