Register Allocation in the SPUR Lisp Compiler

Register allocation is an important component of most compilers, particularly those for RISC machines. The SPUR Lisp compiler uses a sophisticated, graph-coloring algorithm developed by Fredrick Chow [Chow84]. This paper describes the algorithm and the techniques used to implement it efficiently and evaluates its performance on several large programs. The allocator successfully assigned most temporaries and local variables to registers in a wide variety of functions. Its execution cost is moderate.


Publié dans:
ACM SIGPLAN 1986 Symposium on Compiler Construction, 255-263
Année
1986
Publisher:
ACM
Laboratoires:




 Notice créée le 2013-12-23, modifiée le 2019-04-15

Lien externe:
Télécharger le document
URL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)