1) You have a program that produces the following outcomes on a single branch: T, T, T, N, T, T, T, N, T, T, T, N (where T stands for Taken and N for Not Taken). How many of these branches are...


1) You have a program that produces the<br>following outcomes on a single branch: T, T, T,<br>N, T, T, T, N, T, T,<br>T, N (where T stands for Taken and N for Not<br>Taken). How many of these branches are<br>predicted correctly if<br>you are using a1 bit branch predictor, starting<br>out at 0 (where 1 indicates a branch will be<br>taken)?<br>2) Using the set of outcomes from problem 1,<br>how many of those branches are predicted<br>correctly if you are using<br>a 2 bit branch predictor, starting out at 01<br>(where 01 is the

Extracted text: 1) You have a program that produces the following outcomes on a single branch: T, T, T, N, T, T, T, N, T, T, T, N (where T stands for Taken and N for Not Taken). How many of these branches are predicted correctly if you are using a1 bit branch predictor, starting out at 0 (where 1 indicates a branch will be taken)? 2) Using the set of outcomes from problem 1, how many of those branches are predicted correctly if you are using a 2 bit branch predictor, starting out at 01 (where 01 is the "weakly not taken" state)?

Jun 05, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here