This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure
April 1995 (vol. 6 no. 4)
pp. 351-362

Abstract—In this paper, we present some new regular iterative algorithms for matrix multiplication and transitive closure. With these algorithms, by spacetime mapping the 2-D arrays with $2N - 1$ and $\lceil (3N - 1)/2\rceil$ execution times for matrix multiplication can be obtained. Meanwhile, we can derive a 2-D array with $4N - 2$ execution time for transitive closure based on the sequential Warshall-Floyd algorithm. All these new 2-D arrays for matrix multiplication and transitive closure have the advantages of faster and more regular than other previous designs.

Index Terms—Algorithm mapping, matrix multiplication, mesh array, systolic array, spherical array, transitive closure, VLSI architecture.

[1] H. T. Kung and C. E. Leiserson,“Systolic arrays (for VLSI),”inProc. Sparse Matrix Symp., Soc. Indust. Appli. Math., 1978, pp. 256–282.
[2] S.K. Rao,“Regular iterative algorithms and their implementations on processor arrays,” PhD thesis, Stanford Univ., 1985.
[3] V. Van Dongen and P. Quinton,“Uniformization of linear recurrence equations: A step towards the automatic synthesis of systolic arrays,”inProc. Int. Conf. Systolic Array, 1988, pp. 473–482.
[4] P. Quinton, “Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations,” Proc. 11th Ann. Int'l Symp. Computer Architecture, pp. 208-214, June 1984.
[5] V. K. Prasanna Kumar and Y. C. Tsai,“Designing linear systolic arrays,”J. Parallel Distribut. Comput., vol. 7, pp. 441–463, 1989.
[6] ——,“Mapping two dimensional systolic arrays to one dimensional arrays and applications,”inProc. Int. Conf. Parallel Processing, 1988, pp. 39–46.
[7] ——,“Synthesizing optimal family of linear systolic arrays for matrix computations,”inProc. Int. Conf. Systolic Array, 1988, pp. 51–60.
[8] P.J. Varman and I.V. Ramakrishnan, "Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays," IEEE Trans. Computers, vol. 35, no. 11, pp. 989-996, Nov. 1986.
[9] ——,“Modular matrix multiplication on a linear array,”IEEE Trans. Comput., vol. C-33, pp. 952–958, Nov. 1984.
[10] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[11] L. Melkemi and M. Tchuente,“Complex of matrix product on a class of orthogonally connected systolic arrays,”IEEE Trans. Comput., vol. C-36, pp. 615–619, May 1987.
[12] G. J. Li and B. W. Wah,“The design of optimal systolic arrays,”IEEE Trans. Comput., vol. C-34, pp. 66–77, Jan. 1985.
[13] W. A. Porter and J. L. Aravena,“Cylindrical arrays for matrix multiplication,”inProc. 24th Annu. Allerton Conf. Commun., Control Comput., Mar. 1988, pp. 595–602.
[14] S. C. Kak,“Multilayered array computing,”inProc. 1985 Annu. Conf. Inform. Sci. Syst., Mar. 1984, pp. 4.36–4.41.
[15] ——,“A two-layered mesh array for matrix multiplication,”Parallel Comput., vol. 6, pp. 383–385, 1988.
[16] A. Benaini and Y. Robert,“An even faster systolic array for matrix multiplication,”Parallel Comput., vol. 12, pp. 249–254, 1989.
[17] H. V. Jagadish and T. Kailath,“A family of new efficient arrays for matrix multiplication,”IEEE Trans. Comput., vol. C-38, pp. 149–155, Jan. 1989.
[18] S.Y. Kung,S.C. Lo,, and P.S. Lewis,“Optimal systolic design for the transitive closure and the shortest path problems,” IEEE Trans. Computers, vol. 36, pp. 603-614, May 1987.
[19] D.I. Moldovan and J.A.B. Fortes, “Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays,” IEEE Trans. Computers, vol. 35, no. 1, pp.1-12, Jan. 1986.

Citation:
Jong-Chuang Tsay, Pen-Yuang Chang, "Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 351-362, April 1995, doi:10.1109/71.372789
Usage of this product signifies your acceptance of the Terms of Use.