
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
W. Shen, A.Y. Oruc, "On Systolic Contractions of Program Graphs," IEEE Transactions on Computers, vol. 38, no. 10, pp. 14511457, October, 1989.  
BibTex  x  
@article{ 10.1109/12.35839, author = {W. Shen and A.Y. Oruc}, title = {On Systolic Contractions of Program Graphs}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {10}, issn = {00189340}, year = {1989}, pages = {14511457}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.35839}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Systolic Contractions of Program Graphs IS  10 SN  00189340 SP1451 EP1457 EPD  14511457 A1  W. Shen, A1  A.Y. Oruc, PY  1989 KW  systolic contractions; program graphs; time links; loop and path equations; linear programming; graph contractions; program graphics; parallel programming; programming theory. VL  38 JA  IEEE Transactions on Computers ER   
[1] H. T. Kung, "Why systolic architectures,"IEEE Computer Mag., vol. 15, pp. 3746, Jan. 1982.
[2] S. Y. Kung, "On supercomputing with systolic/wavefront array processors,"Proc. IEEE, vol. 72, pp. 867884, July 1984.
[3] G. J. Li and B. W. Wah, "The design of optimal systolic arrays,"IEEE Trans. Comput., vol. C34, pp. 6677, Jan. 1985.
[4] H. T. Kung and C. E. Leiserson, "Systolic arrays for VLSI," inProc. SIAM Sparse Matrix Proc., 1979, pp. 256282.
[5] I. V. Ramakrishnan, D. S. Fussel, and A. Silberchatz, "Mapping homogeneous graphs on linear arrays,"IEEE Trans. Comput., vol. C35, pp. 189209, 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: SpringerVerlag, Dec. 1984.
[7] I. V. Ramakrishnan and P. J. Varman, "Modular matrix multiplication on a linear array,"IEEE Trans. Comput., vol. C33, pp. 952958, 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. C35, no. 11, 1986.
[9] D. I. Moldovan, "On the design of algorithms for VLSI systolic arrays,"Proc. IEEE, vol. no. 1, pp. 113120, 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. 226234.
[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. 213225.
[13] C. E. Leiserson and J. B. Saxe, "Optimizing synchronous systems," inProc. 22nd Annu. Symp. Foundations Comput. Sci., Oct. 1981, pp. 2336.
[14] P. Capello and K. Steiglitz, "Unifying VLSI array designs with geometric transformations," inProc. Int. Conf. Parallel Processing, Aug. 1983, pp. 448457.
[15] W. L. Miranker and A. Winkler, "Spacetime representations of computational structures,"Computing, vol. 32, pp. 93114, 1984.
[16] R. Cytron, "Doacross: Beyond vectorization for multiprocessors (Extended Abstract)," inProc. Int. Conf. Parallel Processing, 1986, pp. 836844.
[17] D. G. Luenberger,Linear and Nonlinear Programming. Reading, MA: AddisonWesley, 1984.
[18] S. N. Cole, "Realtime computation byndimensional iterative arrays of finitestate machines," IEEE Trans. Comput., vol. C18, pp. 349 365, Apr. 1969.