Techniques for reducing the overhead of run-time parallelization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1781, Issue , 2000, Pages 232-248

  Yu, Hao ^a   Rauchwerger, Lawrence ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

ACCESS PATTERNS; LEVEL OF INTEGRATIONS; MEMORY REFERENCES; MEMORY REQUIREMENTS; PARALLEL MACHINE; PARALLELIZING COMPILER; RESTRUCTURING COMPILERS; SPECULATIVE PARALLELIZATION;

COST REDUCTION;

EID: 84872708702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46423-9_16     Document Type: Conference Paper

References (20)

1. Charmm: A program for macromolecular energy, minimization, and dynamics calculations. J of Computational Chemistry, 4(6), 1983.
2. W. Blume et. al. Advanced Program Restructuring for High-Performance Computers with Polaris. IEEE Computer, 29(12):78-82, December 1996.
3. Y. Hao and L. Rauchwerger Adaptive Reduction Parallelization Techniques. Tech. Rept., Dept. of Computer Science, Texas A&M Univ., Dec. 1999.
4. J. Hoeflinger. Interprocedural Parallelization Using Memory Classification Analysis. PhD thesis, University of Illinois, Urbana-Champaign, August, 1998.
5. S. Leung and J. Zahorjan. Improving the performance of runtime parallelization. In 4th PPOPP, pages 83-91, May 1993.
6. Z. Li. Array privatization for parallel execution of loops. In Proc. Of the 19th Int. Symposium on Computer Architecture, pages 313-322, 1992.
7. M. J. Frisch et. al. Gaussian 94, Revision B.1. Gaussian, Inc., Pittsburgh PA, 1995.
8. D. E. Maydan et. al. Data dependence and data-flow analysis of arrays. In Proc. 5th Workshop on Languages and Compilers for Parallel Computing, Aug. 1992.
9. L. Nagel. SPICE2: A Computer Program to Simulate Semiconductor Circuits. PhD thesis, University of California, May 1975.
10. D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29:1184-1201, Dec. 1986.
11. Y. Paek, J. Hoeflinger, and D. Padua. Simplification of Array Access Patterns for Compiler Optimizat ions. In Proc. of the SIGPLAN 1998 Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998.
12. D. Patel and L. Rauchwerger. Implementation issues of loop-level speculative runtime parallelization. In Proc. of the 8th Int. Conference on Compiler Construction (CC’99), Amsterdam, The Netherlands. Lecture Notes in Computer Science, Springer-Verlag, March 1999.
13. L. Rauchwerger, N. Amato, and D. Padua. A scalable method for run-time loop parallelization. Int. J. Paral. Prog., 26(6):537-576, July 1995.
14. L. Rauchwerger and D. Padua. The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. IEEE Trans. on Parallel and Distributed Systems, 10(2), 1999.
15. L. Rauchwerger and D. Padua. Parallelizing WHILE Loops for Multiprocessor Systems. In Proc of 9th Int. Parallel Processing Symposium, April 1995.
16. J. Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. IEEE Trans. Comput., 40(5), May 1991.
17. P. Tu and D. Padua. Automatic array privatization. In Proc. 6th Workshop on Languages and Compilers for Parallel Computing, Portland, OR, Aug. 1993.
18. R. G. Whirley and B. Engelmann. DYNA3D: A Nonlinear, Explicit, Three-Dimensional Finite Element Code For Solid and Structural Mechanics. Lawrence Livermore Labs, Nov., 1993.
19. M. Wolfe. Optimizing Compilers for Supercomputers. The MIT Press, Boston, MA, 1989.
20. C. Zhu and P. C. Yew. A scheme to enforce data dependence on large multiprocessor systems. IEEE Trans. Softw. Eng., 13(6):726-739, June 1987.