Trace driven simulation of dynamic branch prediction schemes

J. F. Gamez; S. Akhtar; S. N.J. Murthy

doi:10.1177/003754970007400404

Trace driven simulation of dynamic branch prediction schemes

J. F. Gamez, S. Akhtar, S. N.J. Murthy

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Simulation studies of two branch prediction schemes in superscalar pipelined computers are presented in this paper. The two studied meth ods are the Per-address Adaptive (PA) scheme and the Global Adaptive (GA) scheme. In addi tion, simulation studies of a modification of the PA scheme, called Switched P/G Adaptive (SPGA), are also presented. Using several benchmarks, it has been illustrated that SPGA scheme has promising results at the possible expense of slight hardware addition.

Original language	English
Pages (from-to)	227-242
Number of pages	16
Journal	Simulation
Volume	74
Issue number	4
DOIs	https://doi.org/10.1177/003754970007400404
State	Published - Apr 2000

Keywords

Computer architecture
bench mark
branch prediction
performance

Access to Document

10.1177/003754970007400404

Cite this

@article{c808c31fd4d34a92b8a42ea05207fde0,

title = "Trace driven simulation of dynamic branch prediction schemes",

abstract = "Simulation studies of two branch prediction schemes in superscalar pipelined computers are presented in this paper. The two studied meth ods are the Per-address Adaptive (PA) scheme and the Global Adaptive (GA) scheme. In addi tion, simulation studies of a modification of the PA scheme, called Switched P/G Adaptive (SPGA), are also presented. Using several benchmarks, it has been illustrated that SPGA scheme has promising results at the possible expense of slight hardware addition.",

keywords = "Computer architecture, bench mark, branch prediction, performance",

author = "Gamez, {J. F.} and S. Akhtar and Murthy, {S. N.J.}",

year = "2000",

month = apr,

doi = "10.1177/003754970007400404",

language = "English",

volume = "74",

pages = "227--242",

journal = "Simulation",

issn = "0037-5497",

number = "4",

}

TY - JOUR

T1 - Trace driven simulation of dynamic branch prediction schemes

AU - Gamez, J. F.

AU - Akhtar, S.

AU - Murthy, S. N.J.

PY - 2000/4

Y1 - 2000/4

N2 - Simulation studies of two branch prediction schemes in superscalar pipelined computers are presented in this paper. The two studied meth ods are the Per-address Adaptive (PA) scheme and the Global Adaptive (GA) scheme. In addi tion, simulation studies of a modification of the PA scheme, called Switched P/G Adaptive (SPGA), are also presented. Using several benchmarks, it has been illustrated that SPGA scheme has promising results at the possible expense of slight hardware addition.

AB - Simulation studies of two branch prediction schemes in superscalar pipelined computers are presented in this paper. The two studied meth ods are the Per-address Adaptive (PA) scheme and the Global Adaptive (GA) scheme. In addi tion, simulation studies of a modification of the PA scheme, called Switched P/G Adaptive (SPGA), are also presented. Using several benchmarks, it has been illustrated that SPGA scheme has promising results at the possible expense of slight hardware addition.

KW - Computer architecture

KW - bench mark

KW - branch prediction

KW - performance

UR - http://www.scopus.com/inward/record.url?scp=24144470858&partnerID=8YFLogxK

U2 - 10.1177/003754970007400404

DO - 10.1177/003754970007400404

M3 - Article

AN - SCOPUS:24144470858

VL - 74

SP - 227

EP - 242

JO - Simulation

JF - Simulation

SN - 0037-5497

IS - 4

ER -

Trace driven simulation of dynamic branch prediction schemes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this