Name
Abstract | ||
|---|---|---|
Choosing the right kind of register for a live range plays a major role in eliminating the register-allocation overhead when the compiled function is frequently executed or function tails are on the most frequently executed paths. Picking the wrong kind of register for a live range incurs a high penalty that may dominate the total overhead of register allocation. In this paper, we present three improvements, storage-class analysis, benefit-driven simplification, and preference decision that are effective in selecting the right kind of register for a live range. Then we compare an enhanced Chaitin-style register allocator (with these three improvements) with priority-based and optimistic coloring. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1145/258915.258942 | Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation |
Keywords | Field | DocType |
register allocation | Register allocation,Computer science,Control register,Real-time computing,Allocator | Conference |
Volume | Issue | ISSN |
32 | 5 | 0362-1340 |
ISBN | Citations | PageRank |
0-89791-907-6 | 9 | 0.73 |
References | Authors | |
15 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guei-Yuan Lueh | 1 | 401 | 37.41 |
| Thomas R. Gross | 2 | 2807 | 404.74 |