Compiler assignment of data items to registers

  • Authors:
  • W. H. E. Day

  • Affiliations:
  • -

  • Venue:
  • IBM Systems Journal
  • Year:
  • 1970

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper formulates as integer programmling problems three methods for assigning data items to registers in the compilation process--the one-one, many-one, and many-few global assignment methods. Three algorithms are described for obtaining feasible solutions to the many-one and many-few global assignment problems. One provides an optimal solution. The others, which provide good approximations, appear to be sufficiently fast for inclusion in an optimizing compiler.