Characterizing the impact of predicated execution on branch prediction

16Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Branch instructions are recognized as a major impediment to exploiting instruction level parallelism. Even with sophisticated branch prediction techniques, many frequently executed branches remain difficult to predict. An architecture supporting predicated execution may allow the compiler to remove many of these hard-to-predict branches, reducing the number of branch mispredictions and thereby improving performance. We present an in-depth analysis of the characteristics of those branches which are frequently mispredicted and examine the effectiveness of an advanced compiler to eliminate these branches. Over the benchmarks studied, an average of 27% of the dynamic branches and 56% of the dynamic branch mispredictions are eliminated with predicated execution support.

Cite

CITATION STYLE

APA

Mahlke, S. A., Hank, R. E., Bringmann, R. A., Gyllenhaal, J. C., Gallagher, D. M., & Hwu, W. M. W. (1994). Characterizing the impact of predicated execution on branch prediction. In Proceedings of the Annual International Symposium on Microarchitecture, MICRO (Vol. Part F129425, pp. 217–227). IEEE Computer Society. https://doi.org/10.1145/192724.192755

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free