
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Cappello, "A ProcessorTimeMinimal Systolic Array for Cubical Mesh Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 1, pp. 413, January, 1992.  
BibTex  x  
@article{ 10.1109/71.113078, author = {P. Cappello}, title = {A ProcessorTimeMinimal Systolic Array for Cubical Mesh Algorithms}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {3}, number = {1}, issn = {10459219}, year = {1992}, pages = {413}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.113078}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A ProcessorTimeMinimal Systolic Array for Cubical Mesh Algorithms IS  1 SN  10459219 SP4 EP13 EPD  413 A1  P. Cappello, PY  1992 KW  Index Termshexagon shaped; cylinder connected; processortimeminimal systolic array; cubical meshalgorithms; directed acyclic graph; timeminimal multiprocessor schedules;processortimeminimal scheduling; triangular shaped 2D directed mesh; matrix product;processing elements; topology; 2D directed mesh; computational complexity; directedgraphs; parallel algorithms; systolic arrays VL  3 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] A. Benaini and Y. Robert, "Spacetimeminimal systolic architectures for gaussian elimination and the algebraic path problem," inProc. Int. Conf. on Applicat. Specific Array Processors, 1990, pp. 747757.
[2] P. R. Cappello, "VLSI architectures for digital signal processing," Ph.D. dissertation, Princeton Univ., Princeton, NJ, Oct. 1982.
[3] P. R. Cappello and A. J. Laub, "Systolic computation of multivariable frequency response,"IEEE Trans. Automat. Contr., vol. 33, pp. 550558, June 1988.
[4] P. R. Cappello and K. Steiglitz, "Unifying VLSI array design with geometric transformations," inProc. Int. Conf. Parallel Processing, H. J. Siegel and L. Siegel, Eds., Bellaire, MI, Aug. 1983, pp. 448457.
[5] P. R. Cappello and K. Steiglitz, "Unifying VLSI array design with linear transformations of spacetime," inAdvances in Computing Research, Vol. 2: VLSI Theory. Greenwich, CT: JAI Press, 1984, pp. 2365.
[6] M. Chen, "A design methodology for synthesizing parallel algorithms and architectures,"J. Parallel Distributed Comput., pp. 461491, Dec. 1986.
[7] M. C. Chen, "The generation of a class of multipliers: Synthesizing highly parallel algorithms in VLSI,"IEEE Trans. Comput., vol. 37, pp. 329338, Mar. 1988.
[8] P. E. Danielsson, "Serial/parallel convolvers,"IEEE Trans. Comput., vol. C33, pp. 652667, July 1984.
[9] J.M. Delosme and I. C. F. Ipsen, "An illustration of a methodology for the construction of efficient systolic architectures in VLSI," inProc. 2nd Int. Symp. VLSI Technol., Syst. and Appl., Taipei, 1985, pp. 268273.
[10] J.M. Delosme and I. C. F. Ipsen, "Systolic array synthesis: Computability and time cones," Tech. Rep. Yale/DCS/RR474, Yale, May 1986.
[11] V. Van Dongen and P. Quinton, "Uniformization of linear recurrence equations: A step toward the automatic synthesis of systolic arrays," inProc. Int. Conf. Systolic Arrays, San Diego, CA, IEEE Computer Society, May 1988, pp. 473482.
[12] J. A. B. Fortes, "Algorithm transformations for parallel processing and VLSI architecture design," Ph.D. dissertation, Univ. of Southern California, Los Angeles, Dec. 1983.
[13] J. A. B. Fortes, K.S. Fu, and B. W. Wah, "Systematic design approaches for algorithmically specified systolic arrays, " inComputer Architecture: Concepts and Systems, V. M. Milutinovic´, Ed. New York: NorthHolland, Elsevier Science, 1988, ch. 11, pp. 454494.
[14] J. A. B. Fortes and D. I. Moldovan, "Parallelism detection and algorithm transformation techniques useful for VLSI architecture design,"J. Parallel Distributed Comput., vol. 2, pp. 277301, Aug. 1985.
[15] J. A. B. Fortes and F. ParisiPresicce, "Optimal linear schedules for the parallel execution of algorithms, " inProc. Int. Conf. Parallel Processing, Aug. 1984, pp. 322328.
[16] P. Gachet, B. Jouannault, and P. Quinton, "Synthesizing systolic arrays using DIASTOL," inProc. Int. Workshop Systolic Arrays, W. Moore, A. McCabe, and R. Urquhart, Eds., University of Oxford, Adam Hilger, July 1986, pp. 2536.
[17] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[18] L. J. Guibas, H.T. Kung, and C. D. Thompson, "Direct VLSI implementation of combinatorial algorithms," inProc. Caltech Conf. VLSI, 1979, pp. 509525.
[19] O. Ibarra and M. Palis, "VLSI algorithms for solving recurrence equations and applications,"IEEE Trans. Acoust., Speech, Signal Processing, vol. 35, no. 7, pp. 10461064, 1987.
[20] H. V. Jagadish, S. K. Rao, and T. Kailath, "Multiprocessor architectures for iterative algorithms,"Proc. IEEE, Sept. 1987.
[21] G. j. Li and B. W. Wah, "The design of optimal systolic algorithms,"IEEE Trans. Comput., vol. C34, no. 1, pp. 6677, 1985.
[22] S. Lennart Johnsson and D. Cohen, "A mathematical approach to modeling the flow of data and control in computational networks," inVLSI Systems and Computations, H. T. Kung, R. Sproull, and G. Steele, Eds. Rockville, MD: Computer Science Press. 1981, pp. 213225.
[23] S. Lennart Johnsson, U. Weiser, D. Cohen, and A. L. Davis, "Toward a formal treatment of VLSI arrays," inProc. 2nd Caltech Conf. VLSI, 1981, pp. 375398.
[24] R. Karp, R. Miller, and S. Winograd, "The Organization of Computations for Uniform Recurrence Equations,"J. ACM, Vol. 14, No. 3, 1967, pp. 563590.
[25] H.T. Kung, "Why systolic architectures?,"IEEE Comput. Mag., vol. 15, pp. 3745, Jan. 1982.
[26] H.T. Kung and C. E Leiserson, "Systolic arrays (for VLSI)," inSparse Matrix Proceedings 1978, I.S. Duff and G. W. Stewart, Eds., SIAM, 1979, pp. 256282.
[27] P. Lee and Z. M. Kedem, "Synthesizing linear array algorithms from nested for loop algorithms,"IEEE Trans. Comput., vol. 37, pp. 15781598, Dec. 1988.
[28] B. Louka and M. Tchuente, "An optimal solution for GaussJordon elimination on 2D systolic arrays, " inSystolic Array Processors, J. V. McCanny, J. McWhirter, and E.E. Swartzlander Jr., Eds. Killarney, Ireland: PrenticeHall, May 1989, pp. 264274.
[29] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: AddisonWesley, 1980, pp. 150152.
[30] L. Melkemi and M. Tchuente, "Complexity of matrix product on a class of orthogonally connected systolic arrays,"IEEE Trans. Comput., vol. C36, pp. 615619, May 1987.
[31] W. L. Miranker and A. Winkler, "Spacetime representations of computational structures,"Computing, vol. 32, pp. 93114, 1984.
[32] D.I. Moldovan, "On the analysis and synthesis of VLSI algorithms,"IEEE Trans. Comput., vol. C31, pp. 11211126, Nov. 1982.
[33] D.I. Moldovan, "On the design of algorithms for VLSI systolic arrays,"Proc. IEEE, vol. 71, pp. 113120, Jan. 1983.
[34] D.I. Moldovan, "Advis: A Software Package for the Design of Systolic Arrays,"IEEE Trans. ComputerAided Design, Jan. 1987, pp. 3340.
[35] C. H. Papadimitriou and J. D. Ullman, "A communicationtime tradeoff,"SIAM J. Comput., vol. 16, no. 4, pp. 639646, Aug. 1987.
[36] N. Petkov,Systolische Algorithmen und Arrays. Berlin, Germany: AkademieVerlag, 1989.
[37] P. Quinton, "Automatic synthesis of systolic arrays from uniform recurrent equations," inProc. 11th Annu. Symp. Comput. Architecture, 1984, pp. 208214.
[38] P. Quinton,The Systematic Design of Systolic Arrays. Princeton NJ: Princeton University Press, 1987, pp. 229260.
[39] P. Quinton, "Mapping recurrences on parallel architectures," inSupercomuter Design: Hardware&Software, Vol. III. Int. Supercomputing Inst., Inc., 1988, pp. 18.
[40] S.V. Rajopadhye and R. M. Fujimoto, "Systolic array synthesis by static analysis of program dependencies, " inParallel Architectures and Languages, Lecture Notes in Computer Science, number 258, J. W. DeBakker, A. J. Nijman, and P. C. Treleaven, Eds. Berlin, Germany: SpringerVerlag. June 1987, pp. 295310.
[41] S. V. Rajopadhye, S. Purushothaman, and R. M. Fujimoto, "On synthesizing systolic arrays from recurrence equations with linear dependencies," inFoundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, number 241, K. V. Nori, Ed. Berlin. Germany: SpringerVerlag, Dec. 1986, pp. 485503.
[42] I. V. Ramakrishnan, D. S. Fussell, and A. Silberschatz, "Mapping homogeneous graphs on linear arrays,"IEEE Trans. Comput., vol. C35, pp. 189209, Mar. 1986.
[43] S. K. Rao, "Regular iterative algorithms and their implementations on processor arrays," Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1985.
[44] C. Scheiman and P.R. Cappello, "A processortime minimal systolic array for transitive closur," inProc. Int. Conf. on Application Specific Array Processors, Princeton, IEEE Computer Society, Sept. 1990, pp. 1931.
[45] W. Shang and J. A. B. Fortes, "Time optimal linear schedules for algorithms with uniform dependencies," inProc. Int. Conf. Systolic Arrays, May 1988, pp. 393402.
[46] L. Snyder, "Introduction to the configurable highly parallel computer,"IEEE Comput. Mag., vol. 5, pp. 4756, Jan. 1982.
[47] E. E. Swartzlander, Ed.,Systolic Signal Processing Systems. New York: Marcel Dekker, July 1987.
[48] U. Weiser and A. L. Davis, "A wavefront notation tool for VLSI array design," inVLSI Systems and Computations, H. T. Kung, R. Sproull, and G. Steele, Eds. Rockville, MD: Computer Science Press, 1981, pp. 226234.
[49] Y. Wong and J.M. Delosme, "Optimization of computation time for systolic arrays," Dep. Comput. Sci. RR651, Yale Univ., May 1989.
[50] Y. Wong and J.M. Delosme, "Optimization of processor count for systolic arrays," Dep. Comput. Sci. RR697, Yale Univ., May 1989.