Applying stack simulation for branch target buffers

Branch target buffer (BTB) is widely used in modern microprocessor designs to reduce the penalties caused by branches. To evaluate the performance of a BTB, trace-driven simulation is often used. However, as the trace of a typical program is very large, the simulation time is often too long. To redu...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software 2000-05, Vol.52 (1), p.67-78
Main Authors: Shiu, R-Ming, Lu, Neng-Pin, Chung, Chung-Ping
Format: Article
Language:English
Subjects:
Branch prediction
Branch target buffer
Predictions
Simulation
Single-pass simulation
Stack simulation
Studies
Systems design
Trace-driven simulation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Branch target buffer (BTB) is widely used in modern microprocessor designs to reduce the penalties caused by branches. To evaluate the performance of a BTB, trace-driven simulation is often used. However, as the trace of a typical program is very large, the simulation time is often too long. To reduce the simulation time, we developed a stack simulation technique for BTB to evaluate many sets of design parameters in one simulation pass. Due to the fact that the prediction information in the BTB does not have the inclusion property – a property which makes the stack simulation work, we propose a state vector method to enumerate the prediction information for different sets of BTB design parameters to mimic the inclusion property. Simulation results show that the state vector method greatly reduces the simulation time. The speedup of the stack simulation for BTB proposed in this paper over the traditional BTB simulation is 4.68 in terms of simulation time when 13 sets of BTB design parameters are simulated in one simulation pass.
ISSN:0164-1212
1873-1228
DOI:10.1016/S0164-1212(99)00133-8