Tree-Based Concurrency Control in Distributed Groupware

Simple item page
dc.contributor.authorIonescu, Mihail
dc.contributor.authorMarsic, Ivan
dc.date.accessioned2020-06-06T09:06:46Z
dc.date.available2020-06-06T09:06:46Z
dc.date.issued2003
dc.description.abstractWe 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.de
dc.identifier.doi10.1023/A:1025049525187
dc.identifier.pissn1573-7551
dc.identifier.urihttp://dx.doi.org/10.1023/A:1025049525187
dc.identifier.urihttps://dl.eusset.eu/handle/20.500.12015/3622
dc.publisherSpringer
dc.relation.ispartofComputer Supported Cooperative Work (CSCW): Vol. 12, No. 3
dc.relation.ispartofseriesComputer Supported Cooperative Work (CSCW)
dc.subjectconcurrency control
dc.subjectdistributed algorithms
dc.subjectgroupware
dc.titleTree-Based Concurrency Control in Distributed Groupwarede
dc.typeText/Journal Article
gi.citation.endPage350
gi.citation.startPage329

Files

Collections

JCSCW Vol. 12 (2003)