
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
O.H. Ibarra, S.M. Sohn, "On Mapping Systolic Algorithms onto the Hypercube," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 1, pp. 4863, January, 1990.  
BibTex  x  
@article{ 10.1109/71.80124, author = {O.H. Ibarra and S.M. Sohn}, title = {On Mapping Systolic Algorithms onto the Hypercube}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, number = {1}, issn = {10459219}, year = {1990}, pages = {4863}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.80124}, 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  On Mapping Systolic Algorithms onto the Hypercube IS  1 SN  10459219 SP48 EP63 EPD  4863 A1  O.H. Ibarra, A1  S.M. Sohn, PY  1990 KW  Index Termsparallel to parallel mappings; performance evaluation; timespace graph; one way linear systolic array; systolic algorithms; hypercube; systolic array algorithms; fixedsize hypercube architecture; twodimensional systolic arrays; interprocessor communication; local computation; parallel computers; 64node NCUBE/7 MIMD hypercube machine; shuffle scheduling problem; finite impulse response filtering; linear contextfree language recognition; matrix multiplication; Boolean transitive closure; cellular arrays;computational complexity; parallel algorithms; parallel architectures VL  1 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Consideration is given to the problem of mapping systolic array algorithms into efficient algorithms for a fixedsize hypercube architecture. The authors describe in detail several optimal implementations of algorithms given for oneway one and twodimensional systolic arrays. Since interprocessor communication is many times slower than local computation in parallel computers built to date, the problem of efficient communication is specifically addressed for these mappings. In order to validate the technique experimentally, five systolic algorithms were mapped in various ways onto a 64node NCUBE/7 MIMD hypercube machine. The algorithms are for the following problems: the shuffle scheduling problem, finite impulse response filtering, linear contextfree language recognition, matrix multiplication, and computing the Boolean transitive closure. Experimental evidence indicates that good performance is obtained for the mappings.
[1] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C35, no. 11, pp. 969977, Nov. 1986.
[2] J. H. Chang, O. H. Ibarra, T. Jiang, and M. A. Palis, "Systolic algorithms for some scheduling and graph problems," inProc. 1988 Int. Conf. Systolic Arrays, May 1988.
[3] M. C. Chen, "Synthesizing systolic design," inProc. Int. Symp. VLSI Tech., Syst., and Appl., Taipei, Taiwan, 1985.
[4] H. D. Cheng and K. S. Fu, "Algorithm partition for a fixedsize VLSI architecture using spacetime domain expansion," inProc. IEEE 7th Symp. Comput. Arithmetic, 1985, pp. 126132.
[5] K. Culik II. J. Gruska, and A. Salomaa, "Systolic trellis automata,"Int. J. Comput. Math., vol. 16, no. 1, pp. 322, 1984.
[6] T. H. Dunigan, "Hypercube performance," inProc. 2nd Conf. Hypercube Multiprocessors, Knoxville, TN, 1986, pp. 178192.
[7] S. L. Graham and M. A. Harrison, "Parsing of general contextfree languages, " inAdvances in Computers, Vol. 14, M. Yovits and M. Rubinoff, Eds. New York: Academic, 1976, pp. 77185.
[8] L. J. Guibas, H.T. Kung, and C. D. Thompson, "Direct VLSI implementations of combinatorial algorithms," inProc. CALTECH Conf. VLSI, Pasadena, CA, Jan. 1979, pp. 509525.
[9] J. P. Hayes, T. N. Mudge, Q. F. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer," inProc. 1986 Int. Conf. Parallel Proc., 1986, pp. 653660.
[10] O. H. Ibarra and S. M. Kim, "Characterizations and computational complexity of systolic trellis automata,"Theor. Comput. Sci., vol. 29, pp. 123153, 1984.
[11] O. Ibarra, S. Kim, and M. Palis, "Designing systolic algorithms using sequential machines,"IEEE Trans. Comput., vol. C35, no. 6, pp. 531542, 1986.
[12] 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.
[13] H. T. Kung, "A listing of systolic papers," Tech. Rep., Dept. Comput. Sci., Carnegie Mellon Univ., 1987.
[14] H. T. Kung, "Why systolic architectures?,"Computer, vol. 15, no. 1, pp. 3746, Jan. 1982.
[15] S.Y. Kung,VLSI Array Processors, Prentice Hall, Englewood Cliffs, N.J. 1988.
[16] G.J. Li and B. W. Wah, "The design of optimal systolic arrays,"IEEE Trans. Comput., vol. C34, pp. 6677, Jan. 1985.
[17] D. I. Moldovan, "On the analysis and synthesis of VLSI algorithms,"IEEE Trans. Comput., vol. C31, pp. 11211126, Nov. 1982.
[18] D. I. Moldovan and J. A. B. Fortes, "Partitioning and mapping algorithms into fixed size systolic arrays,"IEEE Trans. Comput., vol. C35, pp. 112, Jan. 1986.
[19] J. J. Navarro, J. M. Llaberia, and M. Valero, Partitioning: An essential step in mapping algorithms into systolic array processors,"Computer, vol. 20, no. 7, pp. 7789, July 1987.
[20] C. H. Papadimitriou and J. D. Ullman, "A communicationtime tradeoff,"SIAM J. Comput., vol. 16, no. 4, pp. 639646, Aug. 1987.
[21] P. Quinton, "Automatic synthesis of systolic arrays from uniform recurrent equations," inProc. 11th Annu. Symp. Comput. Architecture, 1984, pp. 208214.
[22] S. Ranka, Y. Won, and S. Sahni, "Programming the NCUBE hypercube," Tech. Rep. 8813, Dep. Comput. Sci., Univ. Minnesota, 1988.
[23] Y. Robert and M. Tchuente, "A systolic array for the longest common subsequence problem,"Inform. Processing Lett., vol. 21, pp. 191 198, Oct. 1985.
[24] W. Shang and J. A. B. Fortes, "Independent partitioning of algorithms with uniform dependencies, " inProc. 1988 Int. Conf. Parallel Proc., vol. 2, pp. 2633, 1988.
[25] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
[26] J. Van Leeuwen and M. Nivat, "Efficient recognition of rational expressions,"Inform. Process. Lett., vol. 14, pp. 3438, 1982.