An Approach to Global Register Allocation

Abstract

The thesis presents an approach to the problem of global register allocation as performed by an optimizing compiler. The problem considered is actually the more general one of choosing what physical resource within the target machine will be used to hold the results of various computations in a running program. The results may be the values of common (redundant) subexpressions, partial results developed during expression evaluation, or variables declared by the programmer. An optimizing compiler can make better use of the resources of the target machine if these decisions are all considered together at or near the source level rather than being distributed throughout the compiler and operating at both source and object levels. A decomposition of an optimizing compiler is presented with research focusing on one part of the compiler, namely the part which assigns the computed results to physical locations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1975
Accession Number
ADA024966

Entities

People

  • Richard K. Johnsson

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Assembly Languages
  • Compilers
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Decomposition
  • Integer Programming
  • Language
  • Object Code
  • Operations Research
  • Philosophy
  • Programming Languages
  • Scientific Research
  • Test And Evaluation
  • Universities

Readers

  • Computational Linguistics
  • Operations Research