Efficient graph partitioning algorithms for collaborative grid workflow developer environments

Gergely Sipos, Péter Kacsuk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationEuro-Par 2010 Parallel Processing - 16th International Euro-Par Conference, Proceedings
Pages50-61
Number of pages12
EditionPART 1
DOIs
Publication statusPublished - Nov 22 2010
Event16th International Euro-Par Conference on Parallel Processing, Euro-Par 2010 - Ischia, Italy
Duration: Aug 31 2010Sep 3 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6271 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Euro-Par Conference on Parallel Processing, Euro-Par 2010
CountryItaly
CityIschia
Period8/31/109/3/10

Keywords

  • CSCW
  • collaboration
  • groupware
  • locking
  • real-time
  • workflow

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient graph partitioning algorithms for collaborative grid workflow developer environments'. Together they form a unique fingerprint.

  • Cite this

    Sipos, G., & Kacsuk, P. (2010). Efficient graph partitioning algorithms for collaborative grid workflow developer environments. In Euro-Par 2010 Parallel Processing - 16th International Euro-Par Conference, Proceedings (PART 1 ed., pp. 50-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6271 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-15277-1_6