| 
|
Quote: use linear scan for global register allocation; up to several times faster than graph coloring, within 12% as efficient
topics >
all references >
references p-r >
Topic:
register allocation
Topic:
register allocation by graph coloring
Quotation Skeleton
We describe a new algorithm for fast global … to variables in a single linear-time scan of … coloring, is simple to implement, and results in … based on graph coloring. … [p. 896] The linear scan algorithm is up to … the resulting code is quite efficient: on the … coloring algorithm for all but two benchmarks. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: register allocation (28 items)
Topic: register allocation by graph coloring (21 items)