Efficient partitioning of graphs in collaborative workflow editor systems

Sipos, Gergely and Kacsuk, Péter (2010) Efficient partitioning of graphs in collaborative workflow editor systems. In: Proceedings of the IADIS international conference on collaborative technologies. Freiburg, 2010..

[img] Text
download.phpdownloadda2dc17944b9d40934fa5a11c4150b8b.pdf - Published Version
Restricted to Registered users only

Download (83kB)

Abstract

Collaborative editing systems allow a group of users to view and edit a shared item from geographically dispersed sites. Consistency maintenance in the face of concurrent accesses to shared entities is one of the core issues in the design of these systems. Workflow modelling is a popular technique to describe business processes, scientific experiments, distributed applications. A workflow is directed graph which specifies tasks and data/control dependencies. The paper introduces protocols by which workflow developer environments can enable the concurrent editing of graphs by multiple users. The proposed graph partitioning and pessimistic locking algorithms assure that collaborators cannot break the consistency criteria of workflows by introducing cycles or invalid edges to them. We prove that the solution results correct graphs even when collaborative parties know separate parts of the workflow and do not share their own sub-graphs with each other in real time. A method to compare the efficiency of different graph partitioning algorithms is also provided.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Laboratory of Parallel and Distributed Systems
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:32
Last Modified: 11 Dec 2012 15:32
URI: http://eprints.sztaki.hu/id/eprint/5678

Update Item Update Item