Compiler transformations for high-performance computing

  • Authors:

  • David F. Bacon;Susan L. Graham;Oliver J. Sharp

  • Affiliations:

  • Computer Science Division, University of California, Berkeley, California;Computer Science Division, University of California, Berkeley, California;Computer Science Division, University of California, Berkeley, California

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the last three decades a large number of compiler transformations for optimizing programs have been implemented. Most optimizations for uniprocessors reduce the number of instructions executed by the program using transformations based on the analysis of scalar quantities and data-flow techniques. In contrast, optimizations for high-performance superscalar, vector, and parallel processors maximize parallelism and memory locality with transformations that rely on tracking the properties of arrays using loop dependence analysis.This survey is a comprehensive overview of the important high-level program restructuring techniques for imperative languages, such as C and Fortran. Transformations for both sequential and various types of parallel architectures are covered in depth. We describe the purpose of each transformation, explain how to determine if it is legal, and give an example of its application.Programmers wishing to enhance the performance of their code can use this survey to improve their understanding of the optimizations that compilers can perform, or as a reference for techniques to be applied manually. Students can obtain an overview of optimizing compiler technology. Compiler writers can use this survey as a reference for most of the important optimizations developed to date, and as bibliographic reference for the details of each optimization. Readers are expected to be familiar with modern computer architecture and basic program compilation techniques.