Value reuse improves a processor’s performance by dynamically caching the results of previous instructions and reusing those results to bypass the execution of future instructions that have the same opcode and input operands. However, continually replacing the least recently used entries could eventually fill the value reuse table with instructions that are not frequently executed. Furthermore, the complex hardware that replaces entries and updates the table may necessitate an increase in the clock period. We propose instruction precomputation to address these issues by profiling programs to determine the opcodes and input operands that have the highest frequencies of execution. These instructions then are loaded into the precomputation table before the program executes. During program execution, the precomputation table is used in the same way as the value reuse table is, with the exception that the precomputation table does not dynamically replace any entries. For a 2K-entry precomputation table implemented on a 4-way issue machine, this approach produced an average speedup of 11.0%. By comparison, a 2K-entry value reuse table produced an average speedup of 6.7%. Instruction precomputation outperforms value reuse, especially for smaller tables, with the same number of table entries while using less area and having a lower access time.
|Original language||English (US)|
|Title of host publication||Euro-Par 2002 Parallel Processing - 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings|
|Editors||Burkhard Monien, Rainer Feldmann|
|Number of pages||5|
|State||Published - 2002|
|Event||8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002 - Paderborn, Germany|
Duration: Aug 27 2002 → Aug 30 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002|
|Period||8/27/02 → 8/30/02|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.