Run-time methods for parallelizing partially parallel loops

Proceedings of the International Conference on Supercomputing

Volumn Part F129361, Issue , 1995, Pages 137-146

  Rauchwerger, Lawrence ^a   Amato, Nancy M ^b   Padua, David A ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PRIVATIZATION; CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; DATA REDUCTION; ITERATIVE METHODS; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SYNCHRONIZATION;

ACCESS PATTERNS; LOOP ITERATION; PARALLEL EXECUTIONS; PARALLEL LOOPS; PARALLELIZATIONS; PARALLELIZING; REDUCTION PARALLELIZATION; RUNTIMES;

EMBEDDED SYSTEMS; PARALLEL PROCESSING SYSTEMS;

ARRAY PRIVATIZATION; INSPECTOR CODE; PARALLEL LOOPS; PARALLELIZATION; REDUCTION PARALLELIZATION; RUN TIME METHODS; SCHEDULER CODE;

EID: 0029202238     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/224538.224553     Document Type: Conference Paper

References (35)

1. Alliant Computer Systems Corporation. FXISeries Architecture Manual, 1986.
2. Alliant Computers Systems Corporation. Alliant FX/2800 Series System Description, 1991.
3. U. Banerjee. Dependence Analysis for Supercomputing. Kluwen Boston, MA., 1988.
4. M. Berry and others. The PERFECT club benchmarks: Effective performance evaluation of supercomputers. TR. 827, Ctr. for Super-computing R. & D., Univ. of Illinois, Urbana, IL, May 1989.
5. H. Berryman and J. Saltz. A manual for PARTI runtime primitives. Interim Report 90-13, ICASE, 1990.
6. W. Blume and R. Eigenmann. Performance analysis of parallelizing compilers on the Perfect Benchmarks™ Programs. IEEE Trans, on Parallel and Distributed Systems, 3(6):643-656, Nov. 1992.
7. M. Burke, R. Cytron, J. Ferrante, and W. Hsieh. Automatic generation of nested, fork-join parallelism. J. of Supercomputing, pç. 11-88, 1989.
8. W. J. Camp, S. J. Plimpton, B. A. Hendrickson, and R. W. Leland. Massively parallel methods for engineering and science problems. Comm. ACM, 37(4):31-41, April 1994.
9. D. K. Chen, P. C. Yew, and J. Torrellas. An efficient algorithm for the run-time parallelization of doacross loops. In Proc. of Supercomputing 1994, pp. 518-527, Nov. 1994.
10. I. S. Duff. Ma28-a set of Fortran subroutines for sparse unsymmetric linear equations. Tech. Rept. AERE R8730, HMSO, London, 1977.
11. R. Eigenmann, J. Hoeflinger, Z. Li, and D. Padua. Experience in the automatic parallelization of four Perfect-Benchmark programs. In Lecture Notes in Comp. Science 589. Proc. of the 4th Workshop on Languages and Compilers for Parallel Computing, Santa Clara, CA, pp. 65-83, Aug. 1991.
12. M. Guzzi, D. Padua, J. Hoefhnger, and D. Lawrie. Cedar Fortran and other vector and parallel Fortran dialects. J. Supercomput., 4(1):37-62, March 1990.
13. V. Krothapalli and P. Sadayappan. An approach to synchronization of parallel computing. In Proc. of the 1988 Int Conf. on Supercomputing, pp. 573-581, lune 1988.
14. C. Kruskal. Efficient parallel algorithms for graph problems. In Proc. of the 1986Int. Conf. on Parallel Processing, pp. 869-876, Aug. 1986.
15. D. J. Kuck, R. H. Kuhn, B. Leasure, D. A. Padua, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. of 8th ACM Symp. Prmcip. Prog. Lang., pp. 207-218, Jan. 1981.
16. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
17. S. Leung and J. Zahorjan. Improving the performance of runtime parallelization. In 4th PPOPP, pp. 83-91, May 1993.
18. Zhiyuan Li Array privatization for parallel execution of loops. In Proc. of the 19th Int. Symp. on Comput. Arch., pp. 313-322, 1992.
19. D. E. Maydan, S. P. Amarasinghe, and M.S. Lam. Data dependence and data-flow analysis of arrays. In Proc. 5th Workshop on Programming Languagesand Compilers for Parallel Computing, Aug. 1992.
20. S. Midkiff and D. Padua. Compiler algorithms for synchronization. IEEE Trans Comput., C-36(12):1485-1495, 1987.
21. J. Moreira and C. Polychronopoulos. Autoscheduling m a distributed shared-memory environment. TR. 1373, Ctr. for Supercomputing R. & D., Univ. of Illinois, Urbana, June 1994.
22. D. Padua and M. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29:1184-1201, Dec. 1986.
23. C Polychronopoulos. Compiler optimizations for enhancing parallelism and their Impact on architecture design. IEEE Trans. Comput, C-37(8):991-1004, Aug. 1988.
24. L. Rauchwerger, N. Amato and D. Padua. Run-time methods for parallelizing partially parallel loops. TR. 1400, Ctr. for Supercomputing R. & D., Univ. of Illinois, Urbana, IL, May 1989.
25. L. Rauchwerger and D. Padua. The privatizing doall test: A run-time technique for doall loop identification and array privatization. In Proc. of the 1994 Int Conf. on Supercomputing, pp. 33-43, July 1994.
26. L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In ACM SIGPLAN Conf. on Programming Language Design and Implementation, June, 1995.
27. L. Rauchwergerand D. Padua. Parallelizing while loops for multiprocessor systems. In 9th Int. Parallel Process. Symp., April, 1995.
28. J. Saltz and R. Mirchandaney. The preprocessed doacross loop. In Dr. H.D. Schwetman, editor, Proc. of the 1991 Int. Conf. on Parallel Processing, pp. 174-178. CRC Press, Inc., 1991. Vol. II - Software.
29. J. Saltz, R. Mirchandaney, and K. Crowley. The doconsider loop. In Proc. of the 1989 Int Conf on Supercomputing, pp. 29-40, June 1989.
30. J. Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. IEEE Trans. Comput., 40(5), May 1991.
31. P. Tu and D. Padua. Automatic array privatization. In Proc. 6th Annual Workshop on Languages and Compilers for Parallel Computing, Portland, OR, Aug. 1993.
32. M. Wolfe. Optimizing Compilers for Supercomputers. The MIT Press, Boston, MA, 1989.
33. J. Wu, J. Saltz, S. Hiranandani, and H. Berryman. Runtime compilation methods for multiComputers. In Dr. H.D. Schwetman, editor, Proc. of the 1991 Int. Conf. on Parallel Processing, pp. 26-30. CRC Press, Inc., 1991. Vol. 11 - Software.
34. C. Zhu and P. C. Yew. A scheme to enforce data dependence on large multiprocessor systems. IEEE Trans. Soflw. Eng., 13(6):726-739, 1987.
35. H. Zima. Supercompilers for Parallel and Vector Computers. ACM Press, New York, NY, 1991.