This Article 
 Bibliographic References 
 Add to: 
On Mapping Algorithms to Linear and Fault-Tolerant Systolic Arrays
March 1989 (vol. 38 no. 3)
pp. 470-478
A simple mapping technique is developed to design systolic arrays with limited I/O capability. The technique is used to improve systolic algorithms for some matrix computations on linearly connected arrays of PEs (processor elements) with constant I/O bandwidth. The important features of these designs are modularity with constant hardware in each PE, few control lines, simple data-input/output

[1] M. Chen, "A design methodology for synthesizing parallel algorithms and architectures,"J. Parallel Distributed Comput., pp. 461-491, Dec. 1986.
[2] P. R. Cappello and K. Seiglitz, "Unifying VLSI array designs with geometric transformation," inProc. Int. Conf. Parallel Processing, 1983.
[3] J. A. B. Fortes, K. S. Fu, and B. W. Wah, "Systematic approaches to the design of algorithmically specified systolic arrays," Tech. Rep., Dep. Elec. Eng., Purdue Univ., 1984.
[4] J. Ja'Ja' and V. K. Prasanna Kumar, "Information transfer in distributed computing with applications to VLSI,"J. ACM, Jan. 1984.
[5] H. T. Kung and C. E. Leiserson, "Systolic arrays (for VLSI)," inProc. SIAM Conf. Appl. Math., 1979, pp. 256-282.
[6] V. K. Prasanna Kumar and Yu-Chen Tsai, "On mapping algorithms to linear and fault tolerant systolic arrays," inProc. ICCD, 1986.
[7] V. K. Prasanna Kumar and Yu-Chen Tsai, "On designing an optimal family of linear systolic arrays for matrix multiplication," U.S.C. Tech. Rep., June 1987.
[8] S. Y. Kung, "On supercomputing with systolic/wavefront array processors,"Proc. IEEE, vol. 72, July 1984.
[9] A. V. Kulkari and D'. W. L. Yen, "Systolic processing and an implementation for signal and image processing,"IEEE Trans. Comput., vol. C-31, pp. 1000-1009, Oct. 1982.
[10] G. Melhem and W. C. Rheinboldt, "A mathematical model for the verification of systolic networks,"SIAM J. Comput., vol. 13, pp. 541-565, Aug. 1984.
[11] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[12] P. Quinton, "Automatic synthesis of systolic arrays from uniform recurrent equations," inProc. 11th Annu. Symp. Comput. Architecture, 1984, pp. 208-214.
[13] J. Raffel, "On the use of nonvolatile programmable links for restructurable VLSI," inProc. Caltech Conf. Very Large Scale Integration, Jan. 1979, pp. 95-104.
[14] C. S. Raghavendra, V. K. Prasanna Kumar, and A. Varma, "On systolic processing with bounded I/O bandwidth," inProc. ICCD 1985.
[15] I. V. Ramakrishnan and P. J. Varman, "Synthesis of an optimal family of matrix multiplication algorithms on linear arrays," Tech. Rep., Univ. of Maryland, Dep. Comput. Sci.;Proc. ICPP, 1985.
[16] I. V. Ramakrishnan, D. S. Fussell, and A. Silberschatz, "Systolic matrix multiplication on a linear array," inProc. Twentieth Annu. Allerton Conf. Comput., Contr., Commun., Oct. 1982.
[17] A. Rosenberg, "The Diogenes approach to testable fault-tolerant networks of processors,"IEEE Trans. Comput., vol. C-32, pp. 902- 910, 1983.
[18] P. J. Varman and I. V. Ramakrishnan, "Optimal matrix multiplication on fault-tolerant VLSI array," inProc. ICALP, 1985.
[19] P. J. Varman and I. V. Ramakrishnan, "A fault-tolerant VLSI matrix multiplier," inProc. Int. Conf. Parallel Processing, 1986.

Index Terms:
linear systolic arrays; algorithms; fault-tolerant systolic arrays; mapping technique; matrix computations; linearly connected arrays; processor elements; VLSI model; propagation delay; Diogenes methodology; cellular arrays; fault tolerant computing.
V.K.P. Kumar, Y.-C. Tsai, "On Mapping Algorithms to Linear and Fault-Tolerant Systolic Arrays," IEEE Transactions on Computers, vol. 38, no. 3, pp. 470-478, March 1989, doi:10.1109/12.21135
Usage of this product signifies your acceptance of the Terms of Use.