Dual decode architecture for dynamic branch prediction

Vishnu P. Bharadwaj; Manjunath Kohalli

doi:10.1109/I2CT.2017.8226306

Dual decode architecture for dynamic branch prediction

Vishnu P. Bharadwaj, Manjunath Kohalli

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

One of the old techniques for performance improvements is branch prediction. As the branch misprediction rate has reached less than 0.01 for certain techniques, it is safe to say that current branch prediction techniques are very efficient. But for certain critical applications a small misprediction also poses a problem. In this paper, a new prediction technique is discussed which always predicts the branch correctly. This technique works well for else if loop at the cost of increased hardware resources.

Original language	English
Title of host publication	2017 2nd International Conference for Convergence in Technology, I2CT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1140-1143
Number of pages	4
Volume	2017-January
ISBN (Electronic)	9781509043071
DOIs	https://doi.org/10.1109/I2CT.2017.8226306
Publication status	Published - 18-12-2017
Externally published	Yes
Event	2nd International Conference for Convergence in Technology, I2CT 2017 - Pune, India Duration: 07-04-2017 → 09-04-2017

Conference

Conference	2nd International Conference for Convergence in Technology, I2CT 2017
Country/Territory	India
City	Pune
Period	07-04-17 → 09-04-17

All Science Journal Classification (ASJC) codes

Computer Science Applications
Computer Networks and Communications
Information Systems and Management
Health Informatics
Communication

Access to Document

10.1109/I2CT.2017.8226306

Cite this

@inproceedings{6a289dc039a04b839797ebcd0ad2849e,

title = "Dual decode architecture for dynamic branch prediction",

abstract = "One of the old techniques for performance improvements is branch prediction. As the branch misprediction rate has reached less than 0.01 for certain techniques, it is safe to say that current branch prediction techniques are very efficient. But for certain critical applications a small misprediction also poses a problem. In this paper, a new prediction technique is discussed which always predicts the branch correctly. This technique works well for else if loop at the cost of increased hardware resources.",

author = "Bharadwaj, {Vishnu P.} and Manjunath Kohalli",

year = "2017",

month = dec,

day = "18",

doi = "10.1109/I2CT.2017.8226306",

language = "English",

volume = "2017-January",

pages = "1140--1143",

booktitle = "2017 2nd International Conference for Convergence in Technology, I2CT 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2nd International Conference for Convergence in Technology, I2CT 2017 ; Conference date: 07-04-2017 Through 09-04-2017",

}

Bharadwaj, VP & Kohalli, M 2017, Dual decode architecture for dynamic branch prediction. in 2017 2nd International Conference for Convergence in Technology, I2CT 2017. vol. 2017-January, Institute of Electrical and Electronics Engineers Inc., pp. 1140-1143, 2nd International Conference for Convergence in Technology, I2CT 2017, Pune, India, 07-04-17. https://doi.org/10.1109/I2CT.2017.8226306

TY - GEN

T1 - Dual decode architecture for dynamic branch prediction

AU - Bharadwaj, Vishnu P.

AU - Kohalli, Manjunath

PY - 2017/12/18

Y1 - 2017/12/18

N2 - One of the old techniques for performance improvements is branch prediction. As the branch misprediction rate has reached less than 0.01 for certain techniques, it is safe to say that current branch prediction techniques are very efficient. But for certain critical applications a small misprediction also poses a problem. In this paper, a new prediction technique is discussed which always predicts the branch correctly. This technique works well for else if loop at the cost of increased hardware resources.

AB - One of the old techniques for performance improvements is branch prediction. As the branch misprediction rate has reached less than 0.01 for certain techniques, it is safe to say that current branch prediction techniques are very efficient. But for certain critical applications a small misprediction also poses a problem. In this paper, a new prediction technique is discussed which always predicts the branch correctly. This technique works well for else if loop at the cost of increased hardware resources.

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

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

U2 - 10.1109/I2CT.2017.8226306

DO - 10.1109/I2CT.2017.8226306

M3 - Conference contribution

AN - SCOPUS:85046453546

VL - 2017-January

SP - 1140

EP - 1143

BT - 2017 2nd International Conference for Convergence in Technology, I2CT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2nd International Conference for Convergence in Technology, I2CT 2017

Y2 - 7 April 2017 through 9 April 2017

ER -

Dual decode architecture for dynamic branch prediction

Abstract

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this