This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Systolic Contractions of Program Graphs
October 1989 (vol. 38 no. 10)
pp. 1451-1457
A variant of the mapping problem, namely, systolic contractions of program graphs, is considered. The notion of time links is introduced to mechanize the contraction process; the timing of information flow between processors is modeled in terms of fundamental loop and path equations of delays and is optimized using linear programming. While the results apply primarily to systolic contractions,

[1] H. T. Kung, "Why systolic architectures,"IEEE Computer Mag., vol. 15, pp. 37-46, Jan. 1982.
[2] S. Y. Kung, "On supercomputing with systolic/wavefront array processors,"Proc. IEEE, vol. 72, pp. 867-884, July 1984.
[3] G. J. Li and B. W. Wah, "The design of optimal systolic arrays,"IEEE Trans. Comput., vol. C-34, pp. 66-77, Jan. 1985.
[4] H. T. Kung and C. E. Leiserson, "Systolic arrays for VLSI," inProc. SIAM Sparse Matrix Proc., 1979, pp. 256-282.
[5] I. V. Ramakrishnan, D. S. Fussel, and A. Silberchatz, "Mapping homogeneous graphs on linear arrays,"IEEE Trans. Comput., vol. C-35, pp. 189-209, Mar. 1986.
[6] I. V. Ramakrishnan and P. J. Varman, "On mapping cube graphs on VLSI arrays," inProc. 4th Int. Conf. Foundations Software Technol., Lecture Notes in Computer Science, Vol. 181. Berlin, Germany: Springer-Verlag, Dec. 1984.
[7] I. V. Ramakrishnan and P. J. Varman, "Modular matrix multiplication on a linear array,"IEEE Trans. Comput., vol. C-33, pp. 952-958, Nov. 1984.
[8] I. V. Ramakrishnan and P. J. Varman, "Synthesis of an optimal family of matrix multiplication algorithms on linear arrays,"IEEE Trans. Comput., vol. C-35, no. 11, 1986.
[9] D. I. Moldovan, "On the design of algorithms for VLSI systolic arrays,"Proc. IEEE, vol. no. 1, pp. 113-120, 1983.
[10] U. Weiser and A. Davis, "A wavefront notation tool for VLSI array design," inVLSI Systems and Computations, H. T.et al., Eds. Rockville, MD: Computer Science, 1981, pp. 226-234.
[11] W. C. Shen, "On mapping algorithms onto processor arrays," Ph.D. dissertation, ECSE Dept. RPI, Dec. 1987.
[12] L. Johnson and D. Cohen, "A mathematical approach to modeling the flow of data and control in computational networks," inVLSI Systems and Computations, H. T. Kunget al., Eds. Rockville, MD: Computer Science, 1981, pp. 213-225.
[13] C. E. Leiserson and J. B. Saxe, "Optimizing synchronous systems," inProc. 22nd Annu. Symp. Foundations Comput. Sci., Oct. 1981, pp. 23-36.
[14] P. Capello and K. Steiglitz, "Unifying VLSI array designs with geometric transformations," inProc. Int. Conf. Parallel Processing, Aug. 1983, pp. 448-457.
[15] W. L. Miranker and A. Winkler, "Spacetime representations of computational structures,"Computing, vol. 32, pp. 93-114, 1984.
[16] R. Cytron, "Doacross: Beyond vectorization for multiprocessors (Extended Abstract)," inProc. Int. Conf. Parallel Processing, 1986, pp. 836-844.
[17] D. G. Luenberger,Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
[18] S. N. Cole, "Real-time computation byn-dimensional iterative arrays of finite-state machines," IEEE Trans. Comput., vol. C-18, pp. 349- 365, Apr. 1969.

Index Terms:
systolic contractions; program graphs; time links; loop and path equations; linear programming; graph contractions; program graphics; parallel programming; programming theory.
Citation:
W. Shen, A.Y. Oruc, "On Systolic Contractions of Program Graphs," IEEE Transactions on Computers, vol. 38, no. 10, pp. 1451-1457, Oct. 1989, doi:10.1109/12.35839
Usage of this product signifies your acceptance of the Terms of Use.