A Simple Interprocedural Register Allocation Algorithm and Its Effectiveness for Lisp

@article{Steenkiste1989ASI,
  title={A Simple Interprocedural Register Allocation Algorithm and Its Effectiveness for Lisp},
  author={Peter Steenkiste and John L. Hennessy},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1989},
  volume={11},
  pages={1-32}
}
Register allocation is an important optimization in many compilers, but with per-procedure register allocation, it is often not possible to make good use of a large register set. Procedure calls limit the improvement from global register allocation, since they force variables allocated to registers to be saved and restored. This limitation is more pronounced in LISP programs due to the higher frequency of procedure calls. An interprocedural register allocation algorithm is developed by… CONTINUE READING
Highly Cited
This paper has 57 citations. REVIEW CITATIONS