Graph coloring register allocation for processors with multi-register operands

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Nickerson, B. R. (1990). Graph coloring register allocation for processors with multi-register operands. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (Vol. 20-22-June-1990, pp. 40–52). Association for Computing Machinery. https://doi.org/10.1145/93542.93552

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free