Efficient graph partitioning algorithms for collaborative grid workflow developer environments

Sipos, Gergely and Kacsuk, Péter (2010) Efficient graph partitioning algorithms for collaborative grid workflow developer environments. In: - Springer, Berlin, pp. 50-61.

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

Download (260kB)


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. The paper introduces a lock based solution and three associated algorithms by which grid workflow developer environments can enable concurrent access to grid applications for multiple persons. The methods assure that collaborators cannot break the consistency criteria of workflows by introducing cycles or invalid edges to them. A formal analysis of the three algorithms is provided, focusing on the number of users that can simultaneously edit the same graph. Based on the findings an integrated algorithm is defined and it allows even more users to collaborate during workflow development.

Item Type: Book Section
Uncontrolled Keywords: workflow, collaboration, real-time, groupware, locking, CSCW
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 16:04
Last Modified: 11 Dec 2012 16:04
URI: https://eprints.sztaki.hu/id/eprint/5709

Update Item Update Item