4:39 Initially the value of 'a' is 0. Thus, (a % 2 == 0) is true, which means that jump should NOT be taken to instruction 'a++'. In short, we should have 'branch not taken'. But why does it tell 'taken' as correct for B1?
At 23:50 when LPT is 01 and the branch is taken, according to the 2-bit branch predictor diagram it has to be changed to 11. But why is it changed to 10?
nvm, i got it. M and K can be independent of each other. K is the last bit of address we can use and M is the bit of history we can use. so we can have 2^4=12 slots with 3 bit history table
Dude bless your soul! we need more people like you.
examples made it easy to understand. Thankyou Sir
Nicely taken with simple example. Thank you sir
Great teaching, Thank you for this great lecture, sir.
Really Good work sir. After watching couple of videos, your example made more sense! Thanks a lot!
Exactly ,what i needed!Thank you !
4:39
Initially the value of 'a' is 0. Thus, (a % 2 == 0) is true, which means that jump should NOT be taken to instruction 'a++'. In short, we should have 'branch not taken'. But why does it tell 'taken' as correct for B1?
@14:35 why are 2^m brand predictors needed?
At 23:50 when LPT is 01 and the branch is taken, according to the 2-bit branch predictor diagram it has to be changed to 11. But why is it changed to 10?
Why are there 2^m predictors needed? I don't understand
Nice
can some 1 explain around 15:40 . (2^k) *m isn't K and M the samething? what dose those 2 values depend on?
nvm, i got it. M and K can be independent of each other. K is the last bit of address we can use and M is the bit of history we can use. so we can have 2^4=12 slots with 3 bit history table
correct me if im wrong =D
Thank you sir!
Correlating branch predictors are taught in this video.
Pc value is given or assumption
thank you