A randomized heuristic approach to register allocation

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a randomized algorithm to generate contiguous evaluations for expression DAGs representing basic blocks of straight line code with nearly minimal register need. This heuristic may be used to reorder the statements in a basic block before applying a global register allocation scheme like Graph Coloring. Experiments have shown that the new heuristic produces results which are about 30% better on the average than without reordering.

Cite

CITATION STYLE

APA

Keßler, C. W., Paul, W. J., & Rauber, T. (1991). A randomized heuristic approach to register allocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 528 LNCS, pp. 195–206). Springer Verlag. https://doi.org/10.1007/3-540-54444-5_99

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