Abstract

Simulation studies of two branch prediction schemes in superscalar pipelined computers are presented in this paper. The two studied meth ods are the Per-address Adaptive (PA) scheme and the Global Adaptive (GA) scheme. In addi tion, simulation studies of a modification of the PA scheme, called Switched P/G Adaptive (SPGA), are also presented. Using several benchmarks, it has been illustrated that SPGA scheme has promising results at the possible expense of slight hardware addition.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.