@inproceedings{6d81ea6617504a3e890824b5acd07f04,
title = "A systematic approach to branch speculation",
abstract = "A general theoretical framework is developed for the study of branch speculation. The framework yields a systematic way to select the schedule in a given set that, for any (estimated) bias of the branch, minimizes the expected execution time. Among other things, it is shown that in some cases the optimal schedule is neither of those resulting from aggressively speculating on any given outcome of the conditional. Our results can be useful in either static or dynamic approaches. We propose a simple run-time estimator for the bias and discuss how to combine it with schedule selection. A number of examples motivate and illustrate the techniques, and show that our approach yields better performance in the case of highly unpredictable branches.",
author = "Gianfranco Bilardi and Alex Nicolau and Joe Hummel",
note = "Publisher Copyright: {\textcopyright} 1998, Springer-Verlag. All rights reserved.; 10th Annual International Workshop on Languages and Compilers for Parallel Computing, LCPC 1997 ; Conference date: 07-08-1997 Through 09-08-1997",
year = "1998",
doi = "10.1007/BFb0032707",
language = "English (US)",
isbn = "3540644725",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "394--411",
editor = "Pen-Chung Yew and Chua-Huang Huang and P. Sadayappan and Zhiyuan Li and Siddharta Chatterjee and David Sehr",
booktitle = "Languages and Compilers for Parallel Computing - 10th International Workshop, LCPC 1997, Proceedings",
}