Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Instruction pre-processing in trace processors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Jacobson, Q. ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; Smith, J.E.

In trace processors, a sequential program is partitioned at run time into “traces”. A trace is an encapsulation of a dynamic sequence of instructions. A processor that uses traces as the unit of sequencing and execution achieves high instruction fetch rates and can support very wide-issue execution engines. We propose a new class of hardware optimizations that transform the instructions within traces to increase the performance of trace processors. Traces are “pre-processed” to optimize the instructions for execution together. We propose three specific optimizations: instruction scheduling, constant propagation, and instruction collapsing. Together, these optimizations offer substantial performance benefit, increasing performance by up to 24%

Published in:

High-Performance Computer Architecture, 1999. Proceedings. Fifth International Symposium On

Date of Conference:

9-13 Jan 1999