This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Utilizing Multidimensional Loop Parallelism on Large Scale Parallel Processor Systems
September 1989 (vol. 38 no. 9)
pp. 1285-1296
Program parallelism and processor allocation issues for parallel processor systems are discussed. Optimal processor assignment algorithms are presented for simple and complex nested parallel loops. These processor assignment schemes can be used by the compiler to perform static processor allocation to multiply nested parallel loops. Speedup measurements for EISPACK and IEEE DSP subroutines that

[1] W. L. Bain, "Hardware scheduling strategies for systems with many processors," inProc. Int. Conf. Parallel Processing, Aug. 1979.
[2] R. G. Cytron, "Compile-time scheduling and optimization for multiprocessors," Ph.D. dissertation, Univ. of Illinois at Urbana-Champaign, DCS Rep. UIUCDCS-R-84-1177, 1984.
[3] J. J. Dongarra, "Comparison of the CRAY X-MP-4, Fujitsu VP-200, and Hitachi S-810/20: An Argonne perspective," Argonne Nat. Lab., ANL-85-19, Oct. 1985.
[4] L.R. Morris,Digital Signal Processing Software, DSPS Inc., Ottawa, Canada, 1982.
[5] D. J. Kuck, R.H. Kuhn, B. Leasure, D.A. Padua, and M. Wolfe, "Compiler transformation of dependence graphs," inConf. Rec. 8th ACM Symp. Principles Program. Languages, Williamsburg, VA, Jan. 1981.
[6] D. J. Kuck,The Structure of Computers and Computations, vol. 1. New York: Wiley, 1978.
[7] D. J. Kuck, R. H. Kuhn, B. Leasure, and M. Wolfe, "The structure of an advanced vectorizer for pipelined processors," inProc. Fourth Int. Comput. Software Appl. Conf., Oct. 1980.
[8] D. J. Kucket al., "The effects of program restructuring, algorithm change and architecture choice on program performance," inProc. Int. Conf. Parallel Processing, Aug. 1984.
[9] R. Manner, "Hardware task/processor scheduling in a polyprocessor environment,"IEEE Trans. Comput., vol. C-33, July 1984.
[10] D. A. Padua, "Multiprocessors: Discussion of theoretical and practical problems," Ph.D. dissertation, Univ. of Illinois at Urbana-Champaign, Rep. UIUCDCS-R-79-990, Nov. 1979.
[11] C. D. Polychronopoulos, "On program restructuring, scheduling, an communication for parallel processor systems," Ph.D. dissertation, CSRD 595, Center of Supercomput. Res. Develop., University of Illinois, Aug. 1986.
[12] C. D. Polychronopoulos and U. Banerjee, "Processor allocation for horizontal and vertical parallelism and related speedup bounds,"IEEE Trans. Comput., vol. C-36, pp. 410-420, Apr. 1987.
[13] C. Polychronopoulos and D. Kuck, "Guided self-scheduling: A practical scheduling scheme for parallel supercomputers,"IEEE Tran. Comput., 1987.
[14] H. S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE-3, Jan. 1977.
[15] P. Tang and P. C. Yew, "Processor self-scheduling for multiple-nested loops," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986.
[16] A. V. Veidenbaum, "Compiler optimizations and architecture design issues for multiprocessors," Ph.D. dissertation, Center for Supercomput. Res. Develop. Rep. 520, Univ. of Illinois, Urbana, 1985.

Index Terms:
multidimensional loop parallelism; large scale parallel processor systems; processor allocation; processor assignment algorithms; complex nested parallel loops; compiler; static processor allocation; EISPACK; IEEE DSP subroutines; parallel processing.
Citation:
C.D. Polychronopoulos, D.J. Kuck, D.A. Padua, "Utilizing Multidimensional Loop Parallelism on Large Scale Parallel Processor Systems," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1285-1296, Sept. 1989, doi:10.1109/12.29467
Usage of this product signifies your acceptance of the Terms of Use.