Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1990: Graph Grammars and Their Application to Computer Science pp 207–220Cite as

Graphic equivalence and computer optimization

  • Conference paper
  • First Online:

  • 195 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 532))

Abstract

Procedure graphs are directed graphs with arc labels denoting precedence, useful in modelling computer algorithms. Equivalent procedure graphs yield the same data outcome under identical inputs, yet imply different performance, cost and practicability; they offer opportunities for optimization through judicious selection. Examples are given together with observations on computer architecture.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tien Chi Chen, "Overlap and pipeline processing," Chapter 9 in Introduction to Computer Architecture (H. Stone, Ed.), 2nd. Ed., Science Research Associates, Chicago, (1980).

    Google Scholar 

  2. Tien Chi Chen and Willis K. King, "Computational invariance and generalized internal forwarding," Proc. Int. Symp. on Comput. Arch. and Digital Signal Processing (CA-DSP '89), Hong Kong, (1989),212–216.

    Google Scholar 

  3. P. Dewilde, E. Deprettere and R. Nouta, "Parallel and pipelined VLSI implementation od signal processing algotithms," Chapter 15 in S.Y. Kung, H.J. Whitehouse and T. Kailath (Eds.), VLSI and Modern Signal Processing, Prentice-Hall, Englewood Cliffs, NJ, 1984, 257–276.

    Google Scholar 

  4. H. Ehrig, "Introduction to the algebraic theory of graph grammars (a survey),"Lecture Notes in Computer Science 73, Graph-Grammars and their Application to Computer Science and Biology, Springer-Verlag, Berlin, 1979.

    Google Scholar 

  5. H. Ehrig, "Tutorial introduction to the algebraic approach of graph grammars,"Lecture Notes in Computer Science 291, Graph Grammars and their Application to Computer Science. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  6. A. Gottlieb et. al., "The NYU Ultracomputer — Designing an MIMD Shared Memory Parallel Computer," IEEE Trans. Comput. C-32, (1983), 175–189.

    Google Scholar 

  7. R. M. Russell, "The Cray-1 Computer System," Comm. ACM 21, (1978), 63–72.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Chinese University of Hong Kong, Shatin, Hong Kong

    Tien Chi Chen

Authors
  1. Tien Chi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, T.C. (1991). Graphic equivalence and computer optimization. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017391

Download citation

  • DOI: https://doi.org/10.1007/BFb0017391

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation