Maintaining consistency properties of grid workflows in collaborative editing systems

Gergely Sipos, P. Kacsuk

Research output: Conference contribution

5 Citations (Scopus)

Abstract

Real-time collaborative editing systems allow a group of users to view and edit the same item at the same time 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 locking based approach that grid application developer environments can apply to protect the consistency properties of workflows during collaborative editing scenarios. We developed two pessimistic locking algorithms to assure that under no circumstances can application developers break the acyclic criteria of workflow graphs or add invalid edges to them. We prove that the algorithms result consistent graphs, moreover, do not result the cancellation of any user's editing transaction. We see that the second, improved algorithm gives much better performance in terms of number of concurrent users that can work on a graph.

Original languageEnglish
Title of host publication8th International Conference on Grid and Cooperative Computing, GCC 2009
Pages168-175
Number of pages8
DOIs
Publication statusPublished - 2009
Event8th International Conference on Grid and Cooperative Computing, GCC 2009 - Lanzhou, Gansu, China
Duration: aug. 27 2009aug. 29 2009

Other

Other8th International Conference on Grid and Cooperative Computing, GCC 2009
CountryChina
CityLanzhou, Gansu
Period8/27/098/29/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture
  • Software

Cite this

Sipos, G., & Kacsuk, P. (2009). Maintaining consistency properties of grid workflows in collaborative editing systems. In 8th International Conference on Grid and Cooperative Computing, GCC 2009 (pp. 168-175). [5279611] https://doi.org/10.1109/GCC.2009.72

Maintaining consistency properties of grid workflows in collaborative editing systems. / Sipos, Gergely; Kacsuk, P.

8th International Conference on Grid and Cooperative Computing, GCC 2009. 2009. p. 168-175 5279611.

Research output: Conference contribution

Sipos, G & Kacsuk, P 2009, Maintaining consistency properties of grid workflows in collaborative editing systems. in 8th International Conference on Grid and Cooperative Computing, GCC 2009., 5279611, pp. 168-175, 8th International Conference on Grid and Cooperative Computing, GCC 2009, Lanzhou, Gansu, China, 8/27/09. https://doi.org/10.1109/GCC.2009.72
Sipos G, Kacsuk P. Maintaining consistency properties of grid workflows in collaborative editing systems. In 8th International Conference on Grid and Cooperative Computing, GCC 2009. 2009. p. 168-175. 5279611 https://doi.org/10.1109/GCC.2009.72
Sipos, Gergely ; Kacsuk, P. / Maintaining consistency properties of grid workflows in collaborative editing systems. 8th International Conference on Grid and Cooperative Computing, GCC 2009. 2009. pp. 168-175
@inproceedings{237d361d68b248a98d46c99457658e22,
title = "Maintaining consistency properties of grid workflows in collaborative editing systems",
abstract = "Real-time collaborative editing systems allow a group of users to view and edit the same item at the same time 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 locking based approach that grid application developer environments can apply to protect the consistency properties of workflows during collaborative editing scenarios. We developed two pessimistic locking algorithms to assure that under no circumstances can application developers break the acyclic criteria of workflow graphs or add invalid edges to them. We prove that the algorithms result consistent graphs, moreover, do not result the cancellation of any user's editing transaction. We see that the second, improved algorithm gives much better performance in terms of number of concurrent users that can work on a graph.",
keywords = "Acyclic, Collaboration, DAG, Groupware, Locking",
author = "Gergely Sipos and P. Kacsuk",
year = "2009",
doi = "10.1109/GCC.2009.72",
language = "English",
isbn = "9780769537665",
pages = "168--175",
booktitle = "8th International Conference on Grid and Cooperative Computing, GCC 2009",

}

TY - GEN

T1 - Maintaining consistency properties of grid workflows in collaborative editing systems

AU - Sipos, Gergely

AU - Kacsuk, P.

PY - 2009

Y1 - 2009

N2 - Real-time collaborative editing systems allow a group of users to view and edit the same item at the same time 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 locking based approach that grid application developer environments can apply to protect the consistency properties of workflows during collaborative editing scenarios. We developed two pessimistic locking algorithms to assure that under no circumstances can application developers break the acyclic criteria of workflow graphs or add invalid edges to them. We prove that the algorithms result consistent graphs, moreover, do not result the cancellation of any user's editing transaction. We see that the second, improved algorithm gives much better performance in terms of number of concurrent users that can work on a graph.

AB - Real-time collaborative editing systems allow a group of users to view and edit the same item at the same time 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 locking based approach that grid application developer environments can apply to protect the consistency properties of workflows during collaborative editing scenarios. We developed two pessimistic locking algorithms to assure that under no circumstances can application developers break the acyclic criteria of workflow graphs or add invalid edges to them. We prove that the algorithms result consistent graphs, moreover, do not result the cancellation of any user's editing transaction. We see that the second, improved algorithm gives much better performance in terms of number of concurrent users that can work on a graph.

KW - Acyclic

KW - Collaboration

KW - DAG

KW - Groupware

KW - Locking

UR - http://www.scopus.com/inward/record.url?scp=72349090360&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72349090360&partnerID=8YFLogxK

U2 - 10.1109/GCC.2009.72

DO - 10.1109/GCC.2009.72

M3 - Conference contribution

AN - SCOPUS:72349090360

SN - 9780769537665

SP - 168

EP - 175

BT - 8th International Conference on Grid and Cooperative Computing, GCC 2009

ER -