Exploring branch predictability limits with the MTAGE+SC predictor∗
نویسنده
چکیده
In the previous championship CBP-4, the winner of the unlimited storage track [5], poTAGE-SC was combining several TAGE based predictors using different forms of histories (local, global, and frequency), a COLT inspired [3] prediction combiner and a statistical corrector (SC) predictor [8, 10] fed with various forms of branch histories. With MTAGE-SC, we improve this predictor in two ways. First through incorporating new forms of branch histories, adding a new TAGE component and incorporating other forms of histories in the statistical corrector predictor. Second in conveying more information from the TAGE predictors stage to the statistical corrector and to the final prediction computation stage. On the CBP-4 traces, the proposed MTAGE-SC predictor achieves 1.600 mispredictions per thousand instructions (MPKI), while the winner of CBP-4 was achieving 1.691 MPKI. On CBP-5 train traces, the MTAGE-SC predictor achieves 2.596 MPKI, 4.7% lower than the winner of CBP-4 ( 2.717 )1.
منابع مشابه
Exploring Deep Neural Networks for Branch Prediction
Recently, there have been significant advances in deep neural networks (DNNs) and they have shown superior performance in audio and image processing. In this paper, we explore DNNs to push the limit for branch prediction. We treat branch prediction as a classification problem and explore both deep convolutional neural networks (CNNs) and deep belief networks (DBNs) for branch prediction. We ana...
متن کاملDeriving Limits of Branch Prediction with the Fano Inequality
Information theory provides tools and techniques to measure the fundamental limits of predictability. Apart from this formal basis, researchers have attempted to construct so-called ‘optimal’ predictors in order to conduct limits studies for different aspects of program predictability (such as branch outcomes and method return values). This paper reports on two case studies for branch predictio...
متن کاملTAGE-SC-L Branch Predictors∗
The TAGE predictor [12] is considered as one of the most storage effective global branch/path history predictors. It has been shown that associated with small adjunct predictors like a statistical corrector (SC for short) and/or a loop predictor (L for short) [11, 10], TAGE can even be more effective. In this study, we explore the performance limits of these TAGE-SC-L predictors for respectivel...
متن کاملThe Relative Importance of Memory Latency , Bandwidth , and Branch Limits
This study investigates the relative importance of memory latency, memory bandwidth, and branch predictability in determining limits to processor performance. We use an aggressive simulation model with few other limits to study the performance of SPEC92 benchmarks. Our basic machine model assumes a dynamically scheduled processor with a 16536 entry instruction window. Up to 16536 instructions o...
متن کاملLimits to Branch Prediction
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, very few studies address the inherent limit of predictability of program themselves. Programs have an inherent limit of predictability due to the randomness of input data. Knowing the limit helps us to evaluate how good...
متن کامل