Name
Abstract | ||
|---|---|---|
This paper presents a technique called register value prediction (RVP) which uses a type of locality called register-value reuse. By predicting that an instruction will produce the value that is already stored in the destination register, we eliminate the need for large value buffers to enable value prediction. Even without the large buffers, register-value prediction can be made as or more effective than last-value prediction, particularly with the aid of compiler management of values in the register file.Both static and dynamic register value prediction techniques are demonstrated to exploit register-value reuse, the former requiring minimal instruction set architecture changes and the latter requiring a set of small confidence counters. We show an average gain of 12% with dynamic RVP and moderate compiler assistance on a next generation processor, and 15% on a 16-wide processor. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1145/300979.301002 | ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture |
Keywords | Field | DocType |
register file,compiler,computer architecture,hardware,instruction set architecture,registers,instruction sets,computer science | Status register,Register allocation,Instruction register,Memory data register,Computer science,Parallel computing,Control register,Real-time computing,Register window,Register renaming,Processor register | Conference |
Volume | Issue | ISSN |
27 | 2 | 0163-5964 |
ISBN | Citations | PageRank |
0-7695-0170-2 | 35 | 2.20 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dean M. Tullsen | 1 | 4208 | 265.60 |
| John S. Seng | 2 | 116 | 9.71 |