Abstract | ||
---|---|---|
A dynamic instruction trace often contains many unnecessary instructions that are required only by the unexecuted portion of the program. Hot-cold optimization (HCO) is a technique that realizes this performance opportunity. HCO uses profile information to partition each routine into frequently executed (hot) and infrequently executed (cold) parts. Unnecessary operations in the hot portion are removed, and compensation code is added on transitions from hot to cold as needed. We evaluate HCO on a collection of large Windows NT applications. HCO is most effective on the programs that are call intensive and have flat profiles, providing a 3-8% reduction in path length beyond conventional optimization. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1109/MICRO.1996.566452 | MICRO |
Keywords | Field | DocType |
kernel,appropriate technology,instruction sets,optimization,register allocation | Path length,Register allocation,Windows NT,Computer science,Instruction set,Parallel computing,Real-time computing,Operating system | Conference |
ISBN | Citations | PageRank |
0-8186-7641-8 | 25 | 11.28 |
References | Authors | |
10 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Robert Cohn | 1 | 331 | 31.29 |
Geoff Lowney | 2 | 2140 | 136.12 |