Skip to main content
Conference ProceedingsOPEN ACCESS

Garp: Graph abstractions for concurrent programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 300 LNCS 191-205
DOI: 10.1007/3-540-19027-9_13
8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Several research projects are investigating parallel processing languages where dynamic process topologies can be constructed. Failure to impose abstractions on interprocess connection patterns can result in arbitrary interconnection topologies that are difficult to understand. We propose the use of a graph-grammar based formalism to control the complexities arising from trying to program such dynamic networks.

Author supplied keywords

Cite

CITATION STYLE

APA

Kaplan, S. M., & Kaiser, G. E. (1988). Garp: Graph abstractions for concurrent programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 300 LNCS, pp. 191–205). Springer Verlag. https://doi.org/10.1007/3-540-19027-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free