I have a program core consisting of five conditional branches. The program core will be executed millions of times. Below are the outcomes of each branch for one execution of the program core (T for taken and N
for not taken).
Branch 1: T-T-T-T-T
Branch 2: N-N-N-N
Branch 3: N-T-N-T-N-T
Branch 4: N-N-T-T-N
Branch 5: T-T-N-N-T-T-N
Assume that the behavior of each branch remains the same for each program core execution. For dynamic
branch prediction schemes, assume that each branch has its own prediction buffer and each buffer is
initialised to the same state before each execution. List the predictions and the accuracies for each of the
following branch prediction schemes.
(a) Always taken.
(b) Always not taken.
(c) 1-bit predictor, initialized to predict taken.
(d) 2-bit predictor, initialized to weakly predict not taken.
Trending nowThis is a popular solution!
Step by stepSolved in 4 steps
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education