Graphic equivalence and computer optimization
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.
KeywordsProcedure graphs graphic equivalence computer optimization computer system design internal forwarding graphic modelling edge-labelling
Unable to display preview. Download preview PDF.
- [Chen 80]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
- [Chen 89]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
- [Dewilde 85]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
- [Ehrig 79]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
- [Ehrig 87]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
- [Gottlieb 83]A. Gottlieb et. al., "The NYU Ultracomputer — Designing an MIMD Shared Memory Parallel Computer," IEEE Trans. Comput. C-32, (1983), 175–189.Google Scholar
- [Russell 78]