Tree-Based Concurrency Control inDistributed Groupware

  • Authors:
  • Mihail Ionescu;Ivan Marsic

  • Affiliations:
  • Center for Advanced Information Processing (CAIP), Rutgers –/ The State University of New Jersey, Piscataway, NJ 08854-8088, USA (Author for correspondence: Phone: +1 732 445 4208&semi/ Fax: ...;Center for Advanced Information Processing (CAIP), Rutgers –/ The State University of New Jersey, Piscataway, NJ 08854-8088, USA

  • Venue:
  • Computer Supported Cooperative Work
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a novel algorithm, called dARB, forsolving the concurrency control problem indistributed collaborative applications. Themain issue of concurrency control is resolvingthe conflicts resulting from simultaneousactions of multiple users. The algorithmreduces the need for manual conflict resolutionby using a distributed arbitration scheme. Themain advantages of our approach are thesimplicity of use and good responsiveness, asthere are no lock mechanisms. Our algorithmrequires the applications to use a tree as theinternal data structure. This makes itapplication independent and suitable forgeneral collaborative applications. The treerequirement is reasonable since many newapplications use XML (extensible MarkupLanguage) for data representation and exchange,and parsing XML documents results in treestructures. Example applications of thealgorithm, a group text editor and acollaborative 3D virtual environment calledcWorld, are implemented and evaluated in theDISCIPLE collaboration framework. We alsointroduce awareness widgets that users avoidgenerating the conflicting events and help inmanual conflict resolution.