Advertisement

Programming with very large graphs

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

Abstract

The ParaGraph graph editor is a tool for specifying the graphical structure of parallel algorithms. Based on an extended formalism of Aggregate Rewriting Graph Grammars, it is an improvement on existing techniques for describing the families of regular, scalable communication graphs. We expect that ParaGraph will prove useful as a testbed for new techniques for describing, visualizing and analyzing the structure of very large graphs. This work describes ongoing formal (and practical) efforts to make ParaGraph an a effective tool for specifying massive parallelism.

Keywords

graph editors massively parallel programming graph visualization very large graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Duane A. Bailey and Janice E. Cuny. Graph grammar based specification of interconnection structures for massively parallel computation. In Proceedings of the Third International Workshop on Graph Grammars, number 291 in Lecture Notes in Computer Science, pages 73–85, Berlin, 1987. Springer-Verlag.Google Scholar
  2. 2.
    Duane A. Bailey and Janice E. Cuny. ParaGraph: graph editor support for parallel programming environments. Technical Report 89-53, COINS Department, University of Massachusetts at Amherst, July 1989.Google Scholar
  3. 3.
    Duane A. Bailey and Janice E. Cuny. Visual extensions to parallel programming languages. In Languages and Compilers for Parallel Computing, pages 17–36. The MIT Press, 1990.Google Scholar
  4. 4.
    Francine Berman, Michael Goodrich, Charles Koelbel, W. J. Robison III, and Karen Showell. Prep-P: A mapping preprocessor for CHiP architectures. In 1985 International Conference on Parallel Processing, pages 731–733, August 1985.Google Scholar
  5. 5.
    J. C. Browne. Software Engineering of Parallel Programs in a Computationally Oriented Display Environment, pages 75–94. The MIT Press, 1990.Google Scholar
  6. 6.
    J.C. Browne, M. Azam, and S. Sobek. CODE: A unified approach to parallel programming. IEEE Software, pages 10–19, July 1989.Google Scholar
  7. 7.
    Horst Bunke. Graph-Grammars and Their Application to Computer Science and Biology, pages 155–166. Number 73 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1979.Google Scholar
  8. 8.
    Charles D. Fisher. Approaches to specifying aggregate rewriting graph grammar productions. Technical Report 90-49, Univ. of Massachusetts, Amherst, MA, June 1990.Google Scholar
  9. 9.
    Richard M. Fujimoto. Simon: Simulator of multicomputer networks. Technical Report UCB/CSD 83/140, UC Berkeley, Berkeley, August 1983.Google Scholar
  10. 10.
    Michael Himsolt. GraphEd user manual. Technical report, Universitat Passau, Passau, 1990.Google Scholar
  11. 11.
    C.A.R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666–677, 1978.CrossRefGoogle Scholar
  12. 12.
    Alfred A. Hough and Janice E. Cuny. Initial experiences with a pattern-oriented parallel debugger. In ACM SIGPLAN and SIGOPS Workshop on Parallel and Distributed Debugging, May 1988.Google Scholar
  13. 13.
    INMOS. Occam Programming Manual. INMOS, Ltd., Bristol, England, 1983.Google Scholar
  14. 14.
    D. Janssens and G. Rozenberg. Restrictions, extensions, and variations of NLC grammars. Information Sciences, 20:217–244, 1980.CrossRefGoogle Scholar
  15. 15.
    D. Janssens and G. Rozenberg. Graph grammars with neighbourhood-controlled embedding. Theoretical Computer Science, 21:55–74, 1982.CrossRefGoogle Scholar
  16. 16.
    D. Janssens and G. Rozenberg. Graph grammars with node-label controlled rewriting and embedding. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Graph-Grammars and Their Application to Computer Science and Biology, number 153 in Lecture Notes in Computer Science, pages 186–205, Berlin, 1982. Springer-Verlag.Google Scholar
  17. 17.
    Thomas Lengauer. The complexity of compacting hierarchically specified layouts. In Conference on Foundations of Computer Science, pages 358–368, 1982.Google Scholar
  18. 18.
    Thomas Lengauer. Efficient solution of connectivity problems on hierarchically defined graphs. Technical Report Bericht Nr. 24, Universitat-Gesamthochschule Paderborn, Paderborn, West Germany, 1985.Google Scholar
  19. 19.
    Thomas Lengauer. Hierarchical planarity testing algorithms. Technical Report Bericht Nr. 25, Universitat-Gesamthochschule Paderborn, Paderborn, West Germany, 1985.Google Scholar
  20. 20.
    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
  21. 21.
    James Purtilo, Daniel A. Reed, and Dirk C. Grunwald. Environments for prototyping parallel algorithms. In 1987 International Conference on Parallel Processing, pages 431–438, 1987.Google Scholar
  22. 22.
    Lawrence Snyder. Introduction to the configurable, highly parallel computer. Computer, 15(1):47–56, 1982.Google Scholar
  23. 23.
    Lawrence Snyder. Parallel programming and the Poker programming environment. Computer, 17(7):27–37, 1984.Google Scholar
  24. 24.
    David Socha, Mary L. Bailey, and David Notkin. Voyeur: Graphical views of parallel programs. In SIGPLAN Workshop on Parallel and Distributed Debugging, pages 206–215, May 1988.Google Scholar
  25. 25.
    M. Wohlert. Spectral user's manual. Technical report.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Duane A. Bailey
    • 1
  • Janice E. Cuny
    • 2
  • Charles D. Fisher
    • 2
  1. 1.Department of Computer ScienceWilliams CollegeWilliamstown
  2. 2.Department of Computer and Information ScienceUniversity of MassachusettsAmherst

Personalised recommendations