Register allocation via usage counts
Author:
Open Access
- 1 November 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (11) , 638-642
Abstract
This paper introduces the notion of usage counts, shows how usage counts can be developed by algorithms that eliminate redundant computations, and describes how usage counts can provide the basis for register allocation. The paper compares register allocation based on usage counts to other commonly used register allocation techniques, and presents evidence which shows that the usage count technique is significantly better than these other techniques.Keywords
This publication has 8 references indexed in Scilit:
- Register Assignment Algorithm for Generation of Highly Optimized Object CodeIBM Journal of Research and Development, 1974
- Global common subexpression elimination1970
- Optimization of expressions in FortranCommunications of the ACM, 1969
- The multics PL/1 compiler1969
- Object code optimizationCommunications of the ACM, 1969
- A comment on index register allocationCommunications of the ACM, 1967
- Index Register AllocationJournal of the ACM, 1966
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966