Cross cutting condensed graphs

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Condensed Graphs provide a graph based programming model that unifies availability-driven, coercion-driven and control-driven computing. In this paper we explore the issues of concurrency and synchronisation between condensed graph applications. A paradigm for condensed graph synchronisation is proposed and an architectural pattern is developed that forms the basis of a novel synchronisation mechanism.

Original languageEnglish
Title of host publicationProceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05
PublisherCSREA Press
Pages965-973
Number of pages9
ISBN (Print)9781932415605
Publication statusPublished - 2005
Event2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05 - Las Vegas, NV, United States
Duration: 27 Jun 200530 Jun 2005

Publication series

NameProceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05
Volume3

Conference

Conference2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05
Country/TerritoryUnited States
CityLas Vegas, NV
Period27/06/0530/06/05

Keywords

  • Concurrency
  • Condensed graphs
  • Distributed systems
  • Parallel programming
  • Synchronisation

Fingerprint

Dive into the research topics of 'Cross cutting condensed graphs'. Together they form a unique fingerprint.

Cite this