
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J.P. Sheu, C.Y. Chang, "Synthesizing Nested Loop Algorithms Using Nonlinear Transformation Method," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 3, pp. 304317, July, 1991.  
BibTex  x  
@article{ 10.1109/71.86106, author = {J.P. Sheu and C.Y. Chang}, title = {Synthesizing Nested Loop Algorithms Using Nonlinear Transformation Method}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {2}, number = {3}, issn = {10459219}, year = {1991}, pages = {304317}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.86106}, 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  Synthesizing Nested Loop Algorithms Using Nonlinear Transformation Method IS  3 SN  10459219 SP304 EP317 EPD  304317 A1  J.P. Sheu, A1  C.Y. Chang, PY  1991 KW  Index Termsnested loop algorithms; nonlinear transformation method; FORloop models; nestedFORloops; fixed size systolic arrays; space mapping schemes; array processors; parallelform; parallel algorithms; parallel programming VL  2 JA  IEEE Transactions on Parallel and Distributed Systems ER   
FORloops are the main source of parallelism in programs. A nonlinear transformation algorithm for parallelizing the execution of FORloop models is proposed. It is shown that by the mapping of nonlinear transformation, iterations of FORloops can be executed in a parallel form. The algorithm is useful in exploiting the parallelism of FORloops with one or more partitions on the innermost loop. Algorithms to partition and map the nested FORloops onto fixed size systolic arrays are discussed. Based on the time and space mapping schemes, all the iterations of FORloops can be correctly executed on the array processors in a parallel form.
[1] U. Banerjee, S. H. Chen, and D. J. Kuck, "Time and parallel processors bounds for Fortranlike loops,"IEEE Trans. Comput., vol. C28, pp. 660670, Sept. 1979.
[2] Z. Chen and C. C. Chang, "Iterationlevel parallel execution of DO loops with a reduced set of dependence relations,"J. Parallel Distributed Comput., vol. 4, pp. 488504, 1987.
[3] Guerra and Melhem, "Synthesis of systolic algorithm design,"Parallel Comput., vol. 12, pp. 195207, 1989.
[4] R. W. Heuft and W. D. Little, "Improved time and parallel processors bounds for Fortranlike loops,"IEEE Trans. Comput., vol. C31, no. 1, pp. 7882, Jan. 1982.
[5] D. J. Kuck, Y. Muraoka, and S. C. Chen, "On the number of operations simultaneously executable in Fortranlike programs and their resulting speedup,"IEEE Trans. Comput., vol. C21, Dec. 1972.
[6] L. Lamport, "The parallel execution of DO loops,"Commun. ACM, vol. 17, no. 2, pp. 8393, Feb. 1974.
[7] P. Lee and Z. M. Kedam, "Synthesizing linear array algorithms from nested for loop algorithm,"IEEE Trans. Comput., vol. 37, pp. 15781598, Dec. 1988.
[8] P. Lee and Z. M. Kedam, "Mapping nested loop algorithms into multidimensional systolic arrays," inProc. 1989 Int. Conf. Parallel Processing, vol. III, 1989, pp. 206210.
[9] T. C. Lin and D. I. Moldovan, "Tradeoffs in mapping algorithms to array processors," inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 719726.
[10] L. S. Lin, C. W. Ho, and J. P. Sheu, "On the parallelism of nested forloops using index shift method," inProc. Int. Conf. Parallel Processing, vol. 2, 1990, pp. 119123.
[11] 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.
[12] M. Wolfe and Kuck, "Advanced loop interchanging," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 536543.
[13] D. A. Padua, D. J. Kuck, and D. H. Lawrie, "Highspeed multiprocessors and compilation techniques,"IEEE Trans. Comput., vol. C29, pp. 763776, Sept. 1980.
[14] D. A. Padua and M. J. Wolfe, "Advanced compiler optimizations for supercomputers,"Common. ACM, vol. 29, no. 12, pp. 1184 1201, Dec. 1986.
[15] J. K. Peir and Cytron, "Minimum distance: A method for partitioning recurrences for multiprocessors,"IEEE Trans. Comput., vol. 38, Aug. 1989.
[16] C. D. Polychronopoulos, D. J. Kuck, and D. A. Padua, "Utilizing multidimensional loop parallelism on largescale parallel processor systems,"IEEE Trans. Comput., vol. 38, Sept. 1989.