Garp: Graph abstractions for concurrent programming [chapter]

Simon M. Kaplan, Gail E. Kaiser
1988 Lecture Notes in Computer Science  
Several research projects are investigating parallel processing languages where dynamic process ~opologies can be constructed. Failure to impose abstractions on interprocess connection patterns can resull; 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. There is a growing need for effective ways to organize.., distributed programs [14] .
doi:10.1007/3-540-19027-9_13 fatcat:wanxnb5pmfbcjmuxikgc5ktzo4