WestminsterResearch

Efficient graph partitioning algorithms for collaborative grid workflow developer environments

Sipos, Gergely and Kacsuk, Peter K. (2010) Efficient graph partitioning algorithms for collaborative grid workflow developer environments. In: D'Ambra, Pasqua and Guarracino, Mario and Talia, Domenico, (eds.) Euro-Par 2010: parallel processing. Lecture notes in computer science (6271). Springer, pp. 50-61. ISBN 9783642152764

Full text not available from this repository.

Official URL: http://dx.doi.org/ 10.1007/978-3-642-15277-1_6

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. 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
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:11065
Deposited On:07 Aug 2012 10:46
Last Modified:07 Aug 2012 10:46

Repository Staff Only: item control page