Wish Branches: Enabling Adaptive and Aggressive Predicated Execution

Micro
2006
Issue No. 1 - January/February
Abstract - Wish Branches: Enabling Adaptive and Aggressive Predicated Execution

	This Article
	Subscribers, please Login Purchase article: $19 PDF HTML IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hyesoon Kim Articles by Onur Mutlu Articles by Yale N. Patt Articles by Jared Stark

January/February 2006 (vol. 26 no. 1)

pp. 48-58

	ASCII Text	x
	Hyesoon Kim, Onur Mutlu, Yale N. Patt, Jared Stark, "Wish Branches: Enabling Adaptive and Aggressive Predicated Execution," IEEE Micro, vol. 26, no. 1, pp. 48-58, January/February, 2006.

	BibTex	x
	@article{ 10.1109/MM.2006.27, author = {Hyesoon Kim and Onur Mutlu and Yale N. Patt and Jared Stark}, title = {Wish Branches: Enabling Adaptive and Aggressive Predicated Execution}, journal ={IEEE Micro}, volume = {26}, number = {1}, issn = {0272-1732}, year = {2006}, pages = {48-58}, doi = {http://doi.ieeecomputersociety.org/10.1109/MM.2006.27}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - MGZN JO - IEEE Micro TI - Wish Branches: Enabling Adaptive and Aggressive Predicated Execution IS - 1 SN - 0272-1732 SP48 EP58 EPD - 48-58 A1 - Hyesoon Kim, A1 - Onur Mutlu, A1 - Yale N. Patt, A1 - Jared Stark, PY - 2006 KW - Wish branches KW - predicated execution KW - branch prediction KW - wish loops VL - 26 JA - IEEE Micro ER -

Hyesoon Kim, University of Texas at Austin

Onur Mutlu, University of Texas at Austin

Yale N. Patt, University of Texas at Austin

Jared Stark, Intel

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MM.2006.27

The goal of wish branches is to use predicated execution for hard-to-predict dynamic branches, and branch prediction for easy-to-predict dynamic branches, thereby obtaining the best of both worlds. Wish loops, one class of wish branches, use predication to reduce the misprediction penalty for hard-to-predict backward (loop) branches.

Index Terms:

Wish branches, predicated execution, branch prediction, wish loops

Citation:

Hyesoon Kim, Onur Mutlu, Yale N. Patt, Jared Stark, "Wish Branches: Enabling Adaptive and Aggressive Predicated Execution," IEEE Micro, vol. 26, no. 1, pp. 48-58, Jan./Feb. 2006, doi:10.1109/MM.2006.27

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.