101:
55:
Symposium on
Compiler Construction, and published in the symposium proceedings. It was extension of an earlier 1981 paper on the use of graph coloring for register allocation. Chaitin's algorithm formed the basis of a large section of research into register allocators.
165:
146:
139:
170:
132:
45:
41:
26:
83:
75:
37:
116:
112:
23:
159:
66:
Gregory
Chaitin (April 2004). "Register allocation and spilling via graph coloring".
87:
33:
108:
29:
79:
100:
52:
120:
51:Chaitin's algorithm was presented on the 1982
140:
48:for both register allocations and spilling.
8:
44:algorithm that made use of coloring of the
147:
133:
7:
166:Algorithms and data structures stubs
97:
95:
40:. Chaitin's algorithm was the first
36:. It is named after its designer,
14:
99:
1:
32:that uses cost/degree as its
16:Register allocation algorithm
119:. You can help Knowledge by
187:
94:
115:-related article is a
80:10.1145/989393.989403
68:ACM SIGPLAN Notices
42:register allocation
27:register allocation
20:Chaitin's algorithm
46:interference graph
128:
127:
178:
171:Graph algorithms
149:
142:
135:
103:
96:
91:
22:is a bottom-up,
186:
185:
181:
180:
179:
177:
176:
175:
156:
155:
154:
153:
113:data structures
65:
62:
38:Gregory Chaitin
17:
12:
11:
5:
184:
182:
174:
173:
168:
158:
157:
152:
151:
144:
137:
129:
126:
125:
104:
93:
92:
61:
58:
24:graph coloring
15:
13:
10:
9:
6:
4:
3:
2:
183:
172:
169:
167:
164:
163:
161:
150:
145:
143:
138:
136:
131:
130:
124:
122:
118:
114:
110:
105:
102:
98:
89:
85:
81:
77:
73:
69:
64:
63:
59:
57:
54:
49:
47:
43:
39:
35:
31:
28:
25:
21:
121:expanding it
106:
74:(4): 66–74.
71:
67:
50:
34:spill metric
19:
18:
160:Categories
109:algorithms
60:References
30:algorithm
88:23108905
53:SIGPLAN
86:
107:This
84:S2CID
117:stub
111:or
76:doi
162::
82:.
72:39
70:.
148:e
141:t
134:v
123:.
90:.
78::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
