
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
PenYuang Chang, JongChuang Tsay, "Design of SpaceOptimal Regular Arrays for Algorithms with Linear Schedules," IEEE Transactions on Computers, vol. 44, no. 5, pp. 683694, May, 1995.  
BibTex  x  
@article{ 10.1109/12.381953, author = {PenYuang Chang and JongChuang Tsay}, title = {Design of SpaceOptimal Regular Arrays for Algorithms with Linear Schedules}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {5}, issn = {00189340}, year = {1995}, pages = {683694}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.381953}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Design of SpaceOptimal Regular Arrays for Algorithms with Linear Schedules IS  5 SN  00189340 SP683 EP694 EPD  683694 A1  PenYuang Chang, A1  JongChuang Tsay, PY  1995 KW  Algorithm mapping KW  data dependency KW  linear schedule KW  matrix multiplication KW  optimizing compiler KW  spaceoptimal KW  systolic array. VL  44 JA  IEEE Transactions on Computers ER   
[1] H.T. Kung and C.E. Leiserson,“Systolic arrays for VLSI,” Proc. 1978 Soc. for Industrial and Applied Math., pp. 256282, 1979.
[2] J.A.B. Fortes and B.W. Wah,“Systolic arrays—From concept to implementation,” Computer, pp. 1217, July 1987.
[3] J.C. Tsay and P.Y. Chang,“Some new designs of 2D array for matrix multiplication and transitive closure,” IEEE Trans. Parallel and Distributed Systems. Submitted for publication.
[4] P.Y. Chang and J.C. Tsay,“A family of efficient regular arrays for algebraic path problem,” IEEE Trans. Computers, vol. 43, no. 7, pp. 769777, July 1994.
[5] J.C. Tsay and P.Y. Chang,“Design of efficient regular arrays for matrix multiplication by two step regularization,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 215222, Feb. 1995.
[6] V. Van Dongen and P. Quinton,“Uniformization of linear recurrence equations: A step towards the automatic synthesis of systolic arrays,” Proc. Int’l Conf. Systolic Arrays, pp. 473482, 1988.
[7] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[8] Y.W. Wong and J.M. Delosme,“Broadcast removal in systolic algorithms,” Proc. Int’l Conf. Systolic Arrays, pp. 403412, 1988.
[9] 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. 603614, May 1987.
[10] C. Choffrut and K. Culik II,“Folding of the plane and the design of systolic arrays,” Information Processing Letters, vol. 17, pp. 149153, 1983.
[11] J.M. Delosme and I.C.F. Ipsen,“Efficient systolic arrays for the solution of toeplitz systems: An illustration of a methodology for the construction ofsystolic architectures in VLSI,” Proc. Int’l Workshop on Systolic Arrays, pp. 3745, 1986.
[12] J.H. Moreno and T. Lang,“Graphbased partitioning of matrix algorithms for systolic arrays: application to transitive closure,” Proc. Int’l Conf. Parallel Processing, pp. 2831, 1988.
[13] P. Quinton, “Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations,” Proc. 11th Ann. Int'l Symp. Computer Architecture, pp. 208214, June 1984.
[14] S.K. Rao,“Regular iterative algorithms and their implementations on processor arrays,” PhD thesis, Stanford Univ., 1985.
[15] 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.112, Jan. 1986.
[16] W.L. Miranker and A. Winkler,“Spacetime representations of computational structures,” Computing, vol. 32, pp. 92114, 1984.
[17] P.Z. Lee and Z.M. Kedem,“Synthesizing linear array algorithms from nested for loop algorithms,” IEEE Trans. Computers, vol. 37, pp. 1,5781,598, Dec. 1988.
[18] V.P. Roychowdhury and T. Kailath,“Subspace scheduling and parallel implementation of nonsystolic regular iterative algorithms,” J. of VLSI Signal Processing, vol. 1, pp. 127142, 1989.
[19] V. Van Dongen,“Quasiregular arrays: Definition and design methodology,” Proc. Int’l Conf. on Systolic Arrays, pp. 126135, 1989.
[20] W. Shang and J.A.B. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," IEEE Trans. Computers, vol. 40, June 1991.
[21] P. Cappello,“A processortimeminimal systolic array for cubical mesh algorithms,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 413, Jan. 1992.
[22] C.J. Scheiman and R.P. Cappello,“A processortimeminimal systolic array for transitive closure,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 257269, May 1992.
[23] A. Benaini and Y. Robert,“Spacetimeminimal systolic arrays for gaussian elimination and the algebraic path problem,” Parallel Computing, vol. 15, pp. 211225, 1990.
[24] P. Clauss,C. Mongenet,, and G.R. Perrin,“Synthesis of sizeoptimal toroidal arrays for the algebraic path problem: A new contribution,” Parallel Computing, vol. 18, pp. 185194, 1992.
[25] P. Clauss,C. Mongenet,, and G. Perrin,“Calculus of spaceoptimal mappings of systolic algorithms on processor arrays,” J. VLSI Signal Processing, vol. 4, pp. 2736, 1992.
[26] J. Bu and E.F. Deprettere,“Processor clustering for the design of optimal fixedsize systolic arrays,” Proc. Int’l Conf. on Application Specific Array Processors, pp. 402413, Sept. 1991.
[27] A. Darte,T. Risset,, and Y. Robert,“Synthesizing systolic arrays: some recent developments,” Proc. Int’l Conf. on Application Specific Array Processors, pp. 372386, Sept. 1991.
[28] Y. Wong and J. M. Delosme,“Spaceoptimal linear processor allocation for systolic arrays synthesis,” Proc. Sixth Int’l Parallel Processing Symp., pp. 275282, Mar. 1992.
[29] Y.C. Hou and J.C. Tsay,“Equivalent transformations on systolic design represented by generating functions,” J. Information Science and Eng., vol. 5, pp. 229250, 1989.
[30] S.K. Rao and T. Kailath, “Regular Iterative Algorithms and Their Implementation on Processor Arrays,” IEEE Proc., pp. 259269, Mar. 1988.
[31] P.Y. Chang and J.C. Tsay,“Timespace mapping for regular arrays,” Parallel Algorithms and Applications. Submitted for publication.
[32] E.M. Reingold,J. Nieverglt,, and N. Deo,Combinatorial Algorithms: Theory and Practice, Prentice Hall, Englewood Cliffs, N.J., 1977.
[33] P.S. Lewis and S.Y. Kung,“An optimal systolic array for the algebraic path problem,” IEEE Trans. Computers, vol. 40, pp. 100105, Jan. 1991.