Graph coloring register allocation for processors with multi-register operands

  • Authors:
  • Brian R. Nickerson

  • Affiliations:
  • Intel Corporation, 5200 NE Elam Young Parkway, Hillsboro, OR

  • Venue:
  • PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Though graph coloring algorithms have been shown to work well when applied to register allocation problems, the technique has not been generalized for processor architectures in which some instructions refer to individual operands that are comprised of multiple registers. This paper presents a suitable generalization.