Simplifying control flow in compiler-generated parallel code

  • John Mellor-Crummey
  • Vikram Adve
HPF Extensions and Compilers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1366)


This extended abstract motivates and briefly describes a strategy for computing symbolic constraints on values of integer variables and using them to simplify the control flow of compiler-generated parallel programs. This strategy has been implemented and evaluated in context of the Rice dHPF compiler for High Performance Fortran.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Vikram Adve and John Mellor-Crummey. Advanced code generation for High Performance Fortran. In Languages, Compilation Techniques and Run Time Systems for Scalable Parallel Systems, LNCS Series. Springer-Verlag, 1997.Google Scholar
  2. 2.
    W. Blume and R. Eigenmann. Demand-driven symbolic range propagation. In Proceedings of the Eighth Workshop on Languages and Compilers for Parallel Computing, pages 141–160, Columbus, OH, August 1995.Google Scholar
  3. 3.
    François Bourdoncle. Abstract debugging of higher-order imperative languages. In Proceedings of SIGPLAN PLDI '93, pages 46–55, June 1993.Google Scholar
  4. 4.
    R. Cytron et al. Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS, 13(4):451–490, October 1991.Google Scholar
  5. 5.
    M. Gerndt. Updating distributed variables in local computations. Concurrency: Practice and Experience, 2(3):171–193, September 1990.Google Scholar
  6. 6.
    W. H. Harrison. Compiler analysis of the value ranges for variables. IEEE Transactions on Software Engineering, SE-3(3):243–250, May 1977.Google Scholar
  7. 7.
    Paul Havlak. Interprocedural Symbolic Analysis. PhD thesis, Dept. of Computer Science, Rice University, May 1994.Google Scholar
  8. 8.
    Harold Johnson. Data flow analysis of ‘intractable’ imbedded system software. In Proceedings of SIGPLAN Compiler Construction '86, pages 109–117, 1986.Google Scholar
  9. 9.
    W.Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):102–114, August 1992.Google Scholar
  10. 10.
    C.-W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Dept. of Computer Science, Rice University, January 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • John Mellor-Crummey
    • 1
  • Vikram Adve
    • 1
  1. 1.Department of Computer ScienceRice UniversityUSA

Personalised recommendations