This Article 
 Bibliographic References 
 Add to: 
A Family of Efficient Regular Arrays for Algebraic Path Problem
July 1994 (vol. 43 no. 7)
pp. 769-777

The method of decomposing a dependence graph into multiple phases with an appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure. In this paper, we further apply this method to design several parallel algorithms for the algebraic path problem and derive N/spl times/N 2D regular arrays with execution times [9N/2]-2 (for the cylindrical array and the orthogonal one) and 4N-2 (for the spherical one).

[1] H. T. Kung and C. E. Leiserson, "Systolic arrays for VLSI," inProc. 1978 Society for Indust. Appl. Math., 1979, pp. 256-282.
[2] S.K. Rao and T. Kailath, "Regular Iterative Algorithms and Their Implementation on Processor Arrays,"IEEE Proc., Vol. 76, No. 3, Mar. 1988, pp. 259-269.
[3] S. K. Rao and T. Kailath, "What is a systolic algorithm,"? inProc. SPIE Highly Parallel Signal Processing Architectures, 1986, pp. 34-48.
[4] S. K. Rao, "Regular iterative algorithms and their implementations on processor arrays," Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1985.
[5] V. P. Roychowdhury and T. Kailath, "Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms,"J. VLSI Signal Processing, vol. 1, pp. 127-142, 1989.
[6] J. C. Tsay and P. Y. Chang, "Some new designs of 2-D array for matrix multiplication and transitive closure,"IEEE Trans. Parallel Distrib. Syst., June 1991, submitted.
[7] M. Gondran and M. Minoux,Graphs and Algorithms. Chichester, UK: Wiley, 1984.
[8] G. Rote, "A systolic array algorithm for the algebraic path problem,"Computing, vol. 34, pp. 191-219, 1985.
[9] Y. Robert and D. Trystram, "Systolic solution of the algebraic path problem," inProc. Int. Workshop on Systolic Arrays, 1986, pp. 171-180.
[10] F. J. Nunez and M. Valero, "A block algorithm for the algebraic path problem and its execution on a systolic array," inProc. Int. Conf. on Systolic Arrays, 1988, pp. 265-274.
[11] A. Benaini and Y. Robert, "Spacetime-minimal systolic architectures for gaussian elimination and the algebraic path problem," inProc. Int. Conf. on Applicat. Specific Array Processors, 1990, pp. 747-757.
[12] P. S. Lewis and S. Y. Kung, "An optimal systolic array for the algebraic path problem,"IEEE Trans. Comput., vol. 40, pp. 100-105, Jan. 1991.
[13] S. Rajopadhye, "An improved systolic algorithm for the algebraic path problem,"Integration, the VLSI J., vol. 14, pp. 279-296, Feb. 1993.
[14] D. I. Moldovan and J. A. B. Fortes, "Partitioning and mapping algorithms into fixed size systolic arrays,"IEEE Trans. Comput., vol. C-35, pp. 1-12, Jan. 1986.
[15] S. Y. Kung, S. C. Lo, and P. S. Lewis, "Optimal systolic design for the transitive closure problem,"IEEE Trans. Comput., vol. C-36, no. 5, pp. 603-614, May 1987.

Index Terms:
parallel algorithms; computational complexity; systolic arrays; graph theory; matrix algebra; efficient regular arrays; algebraic path problem; dependence graph decomposition; multiple phases; m-phase schedule function; matrix multiplication; transitive closure; parallel algorithms; execution times; cylindrical array; orthogonal array; spherical array; systolic array; VLSI architecture.
Pen-Yuang Chang, Jong-Chuang Tsay, "A Family of Efficient Regular Arrays for Algebraic Path Problem," IEEE Transactions on Computers, vol. 43, no. 7, pp. 769-777, July 1994, doi:10.1109/12.293256
Usage of this product signifies your acceptance of the Terms of Use.