| 
|
QuoteRef: chaiGJ6_1982
topics >
all references >
ThesaHelp:
references c-d
Topic:
graph coloring
Topic:
register allocation by graph coloring
Topic:
set-oriented languages
Reference
Chaitin, G.J., "Register allocation & spilling via graph coloring", Proceedings of the SIGPLAN '82 Symposium on Compiler Construction , SIGPLAN, 17, 6, June 1982, pp. 98-105. Google
99 ;;Quote: 32_color a graph by recursively removing nodes with less than 32 colors; works well
99 ;;Quote: if can not 32-color a graph then add spill code to remove a register node
99 ;;Quote: represent a register interference graph by a bit matrix and adjacency vectors
100 ;;Quote: rebuild interference graph after coalescing nodes; two or three iterations, much smaller graphs
101 ;;Quote: SETL program for register allocation by graph coloring
ThesaHelp: references c-d (337 items)
Topic: graph coloring (7 items)
Topic: register allocation by graph coloring (21 items)
Topic: set-oriented languages (20 items)