Simplifying Control Flow in Compiler-Generated Parallel Code

International Journal of Parallel Programming

Volumn 26, Issue 5, 1998, Pages 613-638

  Mellor Crummey, John ^a   Adve, Vikram ^a  

^a Rice University   (United States)

Author keywords

Constraint propagation; Expression range analysis

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; EFFICIENCY; HIGH LEVEL LANGUAGES; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

CONTROL FLOW;

PROGRAM COMPILERS;

EID: 0032180357     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018776615791     Document Type: Article

References (27)

1. High Performance Fortran Forum, High Performance Fortran Language Specification, Sci. Progr., 2(1-2):1-170 (1993).
2. ANSI X3J3/S8.115, Fortran 90 (June 1990).
3. Vikram Adve and John Mellor-Crummey, Using Integer Sets for Data-Parallel Program Analysis and Optimization, Proc. SIGPLAN '98 Conf. on Progr. Lang. Design and Implementation, Montreal, Canada (June 1998).
4. A. Rogers and K. Pingali, Process Decomposition Through Locality of Reference, Proc. SIGPLAN '89 Conf. Progr. Lang. Design and Implementation, Portland, Oregon (June 1989).
5. François Bourdoncle, Abstract Debugging of Higher-Order Imperative Languages, Proc. SIGPLAN '93 Conf. Progr. Lang. Design and Implementation, pp. 46-55 (June 1993).
6. Harold Johnson, Dataflow Analysis of "Intractable" Imbedded System Software, Proc. SIGPLAN '86 Symp. Compiler Construction, pp. 109-117 (1986).
7. W. H. Harrison, Compiler Analysis of the Value Ranges for Variables, IEEE Trans. Software Engin., SE-3(3):243-250 (May 1977).
8. Priyadarshan Kolte and Michael Wolfe, Elimination of Redundant Array Subscript Range Checks, ACM SIGPLAN '95 Conf. Progr. Lang. Design and Implementation, La Jolla, California, pp. 270-278 (June 1995).
9. W. Blume and R. Eigenmann, Demand-Driven Symbolic Range Propagation, Proc. Eighth Workshop Lang . and Compilers for Parallel Computing, Columbus, Ohio, pp. 141-160 (August 1995).
10. Peng Tu and David Padua, Gated SSA-Based Demand-Driven Symbolic Analysis for Parallelizing Compilers, Proc. 1995 ACM Int'l. Conf. Supercomputing, Barcelona, Spain (July 1995).
11. Preston Briggs, Linda Torczon, and Keith D. Cooper, Using Conditional Branches to Improve Constant Propagation, Technical Report CRPC-TR95533, Center for Research on Parallel Computation, Rice University (April 1995).
12. Paul Havlak, Interprocedural Symbolic Analysis, Ph.D. thesis, Department of Computer Science, Rice University (May 1994). Also available as CRPC-TR94451 from the Center for Research on Parallel Computation and CS-TR94-228 from the Rice Department of Computer Science.
13. C.-W. Tseng, An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. Ph.D. thesis, Department of Computer Science, Rice University (January 1993).
14. M. Gerndt, Updating Distributed Variables in Local Computations, Concurrency: Practice and Experience, 2(3):171-193 (September 1990).
15. Vikram Adve and John Mellor-Crummey, Advanced Code Generation for High Performance Fortran, Languages , Compilation Techniques and Run Time Systems for Scalable Parallel Systems, Lecture Notes in Computer Science Series. Springer-Verlag (to appear). Available as Technical Report CS-TR-98-324, Computer Science Department, Rice University (September 1998).
16. C. Koelbel and P. Mehrotra, Compiling Global Name-Space Parallel Loops for Distributed Execution, IEEE Trans. Parallel and Distrib. Syst., 2(4):440-451 (October 1991).
17. Z. Bozkus, L. Meadows, S. Nakamoto, V. Schuster, and M. Young, Compiling High Performance Fortran, Proc. Seventh SIAM Conf. Parallel Processing for Sci. Comput., pp. 704-709, San Francisco, California (February 1995).
18. M. Gupta, S. Midkiff, E. Schonberg, V. Seshadri, D. Shields, K. Wang, W. Ching, and T. Ngo, An HPF Compiler for the IBM SP2, Proc. Supercomputing '95, San Diego, California (December 1995).
19. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph, ACM Trans. Progr. Lang. Syst., 13(4):451-490 (October 1991).
20. Wayne Kelly, Vadim Maslov, William Pugh, Evan Rosser, Tatiana Shpeisman, and David Wonnacott, The Omega Library Interface Guide, Technical Report, Department of Computer Science, University of Maryland, College Park (April 1996).
21. W. Pugh, A Practical Algorithm for Exact Array Dependence Analysis, Comm. ACM, 35(8):102-114 (August 1992).
22. W. Kelly, W. Pugh, and E. Rosser, Code Generation for Multiple Mappings, Frontiers '95: The Fifth Symp. of Massively Parallel Computation, McLean, Virginia (February 1995).
23. R. E. Tarjan, Testing Flow Graph Reducibility, J. Comput. Syst. Sci. 9:355-365 (1974).
24. Marc Snir, Steve W. Otto, Steven Huss-Lederman, David W. Walker, and Jack Dongarra, MPI: The Complete Reference, MIT Press (1995).
25. Rastislav Bodik, Rajiv Gupta, and Mary Lou Soffa, Interprocedural Conditional Branch Elimination, ACM SIGPLAN '97 Conf. Progr. Lang. Design and Implementation, Las Vegas, Nevada (June 1997).
26. Frank Mueller and David B. Whalley, Avoiding Conditional Branches by Code Replication, ACM SIGPLAN '95 Conf. Progr. Lang. Design and Implementation, La Jolla, California, pp. 56-66 (June 1995).
27. D. Bailey, Tim Harris, William Saphir, Rob van der Wijngaart, Alex Woo, and Maurice Yarrow, The NAS parallel benchmarks 2.0, Technical Report NAS-95-020, NASA Ames Research Center (December 1995).