Graph coloring and JIT compilers.

Though graph coloring works, the time is not usually acceptable. It is
something one would not put in a production compiler.
I would rather use linear scan algorithm {1}. Its performace in within
about 10-12% of graph coloring and I feel the graph coloring is rarely
justified, even if the code if on hot path.


Also an excellent paper on how balance of compile time and run time
performance plays out in JIT environment is this paper from IBM
research {2} . I found it to be an excellent summarizing paper. One
reading of this and you should have very good feel for techniques to
use.


Regards,


~Inderaj


{1} Linear Scan Register Allocation (1999)
Massimiliano Poletto, Vivek Sarkar ACM TOPLAS


{2} Design and evaluation of Dynamic Optimizations for Java
Just-in-Time Compiler
Toshio Suganuma, Toshiaki Yasue et al.
IBM Tokyo Research Laboratory

Return to the comp.compilers page.
Search the comp.compilers archives again.