By Topic

Accurate and Low-Overhead Dynamic Detection and Prediction of Program Phases Using Branch Signatures

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.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Balaji Vijayn ; Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY ; Dmitry V. Ponomarev

We introduce a hardware-only program phase detection and prediction architecture, which improves on the existing proposal by forming the execution footprints using simple bit-vectors called "branch signatures" to capture the set of branches touched during an execution interval. Previous work, in contrast, used the number of instructions executed between the branches to form the footprints. Such a modification significantly simplifies the phase detection logic and also affords numerous additional advantages, such as the detection of fewer distinct phases, less frequent phase transitions and higher phase prediction accuracies. We also show, through extensive simulations, that our simplified phase detection logic performs on par with the original proposal on several phase-based optimizations, such as the issue width adaptation and the exploitation of frequent value locality. At the same time, the proposed logic requires only a fraction of the storage needed by the previous scheme to keep the phase-related information..

Published in:

Computer Architecture and High Performance Computing, 2008. SBAC-PAD '08. 20th International Symposium on

Date of Conference:

Oct. 29 2008-Nov. 1 2008