An approach to programming process interconnection structures: Aggregate rewriting graph grammars

  • Duane A. Bailey
  • Janice E. Cuny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 259)


We describe a mechanism for generating families of process interconnection structures. Parallel programming environments that support individually programmed processor elements should allow the programmer to explicitly specify the necessary channels of communication at the level of logical abstraction of the algorithm. For highly parallel processors, the specification of this structure with traditional methods can be tedious and error-prone. Aggregate rewriting graph grammars provide a framework for describing families of regular graphs. Using this scheme, the difficulty of specifying an algorithm's communication structure is independent of its size. In addition, we note that scripts of derivation sequences generating different members of a family of structures can suggest an intra-family contracting map.


Binary Tree Processor Array Graph Grammar Complete Binary Tree Logical Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Duane A. Bailey and Janice E. Cuny. Graph Grammar Based Specification of Interconnection Structures. Technical Report 87-23, University of Massachusetts at Amherst, March 1987.Google Scholar
  2. [2]
    Duane A. Bailey and Janice E. Cuny. The Use of Shape Grammars in Processor Embeddings. Technical Report A-86-23, University of Massachusetts at Amherst, July 1986.Google Scholar
  3. [3]
    H. Ehrig, M. Pfender, and H. J. Schneider. Graph grammars: an algebraic approach. In 14th Conference on Switching and Automata Theory, pages 167–179, 1973.Google Scholar
  4. [4]
    John P. Fishburn and Raphael A. Finkel. Quotient networks. IEEE Transactions on Computers, C-31(4):288–295, April 1982.Google Scholar
  5. [5]
    Rodney L. Goke. Banyan Networks for Partitioning Multiprocessor Systems. PhD thesis, University of Florida, 1976.Google Scholar
  6. [6]
    D. Janssens and G. Rozenberg. Graph grammars with neighbourhood-controlled embedding. Theoretical Computer Science, 21:55–74, 1982.CrossRefGoogle Scholar
  7. [7]
    D. Janssens and G. Rozenberg. On the structure of node-label-controlled graph languages. Information Sciences, 20:191–216, 1980.CrossRefGoogle Scholar
  8. [8]
    Hungwen Li, Ching-Chy Wang, and Mark Lavin. Structured process: a new language attribute for better interaction of parallel architecture and algorithm. In 1985 International Conference on Parallel Processing, pages 247–254, August 1985.Google Scholar
  9. [9]
    Franco P. Preparata and Jean Vuillemin. The cube-connected cycles: a versatile network for parallel computation. Communications of the ACM, 300–309, May 1981.Google Scholar
  10. [10]
    H. J. Schneider. Graph Grammars, pages 314–331. Lecture Notes in Computer Science, Springer-Verlag, Berlin, September 1977.Google Scholar
  11. [11]
    Lawrence Snyder. Introduction to the configurable highly parallel computer. Computer, 15(1):47–56, January 1982.Google Scholar
  12. [12]
    Harold S. Stone. Parallel processing with the perfect shuffle. IEEE Transactions on Computers, C-20(2):153–161, February 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Duane A. Bailey
    • 1
  • Janice E. Cuny
    • 1
  1. 1.Computer and Information SciencesUniversity of MassachusettsAmherst

Personalised recommendations