Umpire: A reference implementation of the condensed graph model

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

Abstract

Condensed Graphs (CGs) are a computing model that unify the availability, coercion and control driven computing paradigms, which have a proven record as a viable distributed and parallel computing platform. Existing implementations of CG engines have focused on efficiently executing programs in this manner, but have not implemented the full expressive power of the model. This project proposes to implement a reference version of a CG engine, which implements a superset of existing versions.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2003
EditorsH.R. Arabnia, Y. Mun, H.R. Arabnia, Y. Mun
Pages1855-1861
Number of pages7
Publication statusPublished - 2003
EventProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Las Vegas, NV, United States
Duration: 23 Jun 200326 Jun 2003

Publication series

NameProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
Volume4

Conference

ConferenceProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
Country/TerritoryUnited States
CityLas Vegas, NV
Period23/06/0326/06/03

Keywords

  • Condensed graphs
  • Haskell

Fingerprint

Dive into the research topics of 'Umpire: A reference implementation of the condensed graph model'. Together they form a unique fingerprint.

Cite this