Register allocation via usage counts
R. A. Freiburghouse · Communications of the ACM · 1974
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.
Cited by 69 works. doi:10.1145/361179.361201 Open-access PDF
Authors
References
- A study of replacement algorithms for a virtual-storage computer
- Index Register Allocation
- Annual Review in Automatic Programming.
- Object code optimization
- Compiler construction for digital computers
- Global common subexpression elimination
- Optimization of expressions in Fortran
- Global common subexpression elimination
- Register Assignment Algorithm for Generation of Highly Optimized Object Code
- The multics PL/1 compiler