Garp: Graph Abstractions for Concurrent Programming

Simon M. Kaplan, Gail E. Kaiser

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.