Jimenez, Daniel A., Hanson, Heather L., and Lin, Calvin. Boolean Formulabased Branch Prediction for Future Technologies. Submitted to the International Conference on Parallel Architectures and Compilation Techniques (PACT) (2001). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Alloyed Branch History: Combining Global and Local Branch .. - Lu, Lach, Stan, Skadron (2002) (Correct)
....predictor, staticprediction components, and a dynamic selector design that steers branches to the appropriate component. Other recent work has proposed new predictor types that target branches that are not handled well by two level predictors. Examples include perceptrons [16] boolean equations [14], and fourierbased prediction [20] While none of these techniques is likely to work well as a stand alone predictor, it is likely that they would make an excellent combination with an alloyed predictor as part of a new type of hybrid design. VII. CONCLUSIONS AND FUTURE WORK This paper has shown ....
D. A. Jimenez, H. L. Hanson, and C. Lin. Boolean formula-based branch prediction for future technologies. In Proceedings of the 2002.
Delay-Sensitive Branch Predictors for Future Technologies - Jimenez (2002) Self-citation (Jimenez Lin) (Correct)
....even with a smaller dynamic branch predictor. We extend this idea to consider history based predictors encoded in the branch instruction. In our scheme, a branch instruction encodes a Boolean function, learned through profiling, whose input is the branch history and whose output is a prediction [31]. The key to our solution is a concise encoding of Boolean 101 functions based on monotone read once Boolean formulas that is well suited for branch prediction. Whereas an arbitrary Boolean function in N variables requires O(2 ) bits to encode, monotone read once Boolean formulas only ....
Daniel A. Jimenez, Heather L. Hanson, and Calvin Lin. Boolean formulabased branch prediction for future technologies. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, September 2001.
Branch Path Re-Aliasing - Jiménez, Lin Self-citation (Jimnez Lin) (Correct)
....by choosing the best history length and hash fimction to form an index into the PHT. Jimenez et al. propose changing the ISA to allow each branch instruction to represent a Boolean formula chosen at compile time used to guide branch prediction; this work also considers branch predictor delay [11]. August et al. 1] propose placing hint bits in each branch instnction that tell a dynamic predictor what kind of state to examine to make a prediction. Each of these schemes places the contents of the branch instnction on the critical path for branch prediction, which will cause problems in CPUs ....
Daniel A. Jimnez, Heather L. Hanson, and Calvin Lin. Boolean formula-based branch prediction for future technologies. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, September 2001.
Delay-Sensitive Branch Predictors for Future Technologies - Jiménez (2002) Self-citation (Jimenez Lin) (Correct)
....even with a smaller dynamic branch predictor. We extend this idea to consider history based predictors encoded in the branch instruction. In our scheme, a branch instruction encodes a Boolean function, learned through profiling, whose input is the branch history and whose output is a prediction [31]. The key to our solution is a concise encoding of Boolean 101 functions based on monotone read once Boolean formulas that is well suited for branch prediction. Whereas an arbitrary Boolean function in variables requires E 4MF bits to encode, monotone read once Boolean formulas only ....
Daniel A. Jimenez, Heather L. Hanson, and Calvin Lin. Boolean formulabased branch prediction for future technologies. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, September 2001.
Branch Path Re-Aliasing - Jimenez, Lin Self-citation (Jimenez Lin) (Correct)
....by choosing the best history length and hash function to form an index into the PHT. Jimenez et al. propose changing the ISA to allow each branch instruction to represent a Boolean formula chosen at compile time used to guide branch prediction; this work also considers branch predictor delay [11]. August et al. 1] propose placing hint bits in each branch instruction that tell a dynamic predictor what kind of state to examine to make a prediction. Each of these schemes places the contents of the branch instruction on the critical path for branch prediction, which will cause problems in ....
Daniel A. Jimenez, Heather L. Hanson, and Calvin Lin. Boolean formula-based branch prediction for future technologies. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, September 2001.
Enhancing Branch Prediction via On-Line Statistical Analysis - Dropsho (Correct)
No context found.
Jimenez, Daniel A., Hanson, Heather L., and Lin, Calvin. Boolean Formulabased Branch Prediction for Future Technologies. Submitted to the International Conference on Parallel Architectures and Compilation Techniques (PACT) (2001).
Enhancing Branch Prediction via On-Line Statistical Analysis - Dropsho (Correct)
No context found.
Jimenez, Daniel A., Hanson, Heather L., and Lin, Calvin. Boolean formula-based branch prediction for future technologies, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC