Love these lectures!!! Well explained with helpful animations and fast-paced. These lectures are for students who have taken an introductory course in architecture.
Thank you for the lecture! Great stuff!! You could have shown the performance of the 2-bit BHT on the loop example to contrast with the one of the 1-bit BHT
I'm a little confused here. BHT is used to store the history of individual branch. Is there anothere table to record prediction state (prediction wrong or correct)?
Good Video, but is it possible, that the 2-Bit Branch Predictor graph is no correct? If we mispredict from state 10, we should end up in state 01 and not directly in 00. Same goes for 01 taken to 11, shouldnt it change its state to 10? Or am I getting something wrong here?
isnt that the second graph he showed? the first flips to 00 directly, the other decrements and increments, and in practice they dont show much performance difference
This is a good lecture, but for a fresh student (who is just learning micro processors concepts), its too hard to get the concept & basic idea behind the algrithm. You need to take students from a bit low level to high. For example, you should explain how that state machine is formed & what is the basic idea of branch prediction. This makes students to think than just blindly memorizing the state diagram.
This video series is exactly what I needed
Love these lectures!!! Well explained with helpful animations and fast-paced. These lectures are for students who have taken an introductory course in architecture.
Thank you for the lecture! Great stuff!! You could have shown the performance of the 2-bit BHT on the loop example to contrast with the one of the 1-bit BHT
I'm a little confused here. BHT is used to store the history of individual branch. Is there anothere table to record prediction state (prediction wrong or correct)?
Great explanation
Why can 2 for
Loops of equal magnitude say linear time have different run times??
Sehr gut.. Danke
Transfer Learning to increase branch predictability ???
Good Video, but is it possible, that the 2-Bit Branch Predictor graph is no correct? If we mispredict from state 10, we should end up in state 01 and not directly in 00. Same goes for 01 taken to 11, shouldnt it change its state to 10? Or am I getting something wrong here?
isnt that the second graph he showed? the first flips to 00 directly, the other decrements and increments, and in practice they dont show much performance difference
Great video, thank you!
This is a good lecture, but for a fresh student (who is just learning micro processors concepts), its too hard to get the concept & basic idea behind the algrithm. You need to take students from a bit low level to high. For example, you should explain how that state machine is formed & what is the basic idea of branch prediction. This makes students to think than just blindly memorizing the state diagram.
He did a decent job explaining. get gud bruh