DerekChiou_EE360N_Spring2010_Lecture20

DerekChiou_EE360N_Spring2010_Lecture20 - Lecture 20: Branch...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
© Derek Chiou 1 Lecture 20: Branch Prediction Prof. Derek Chiou University of Texas at Austin
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Test of size Announcements Exam coming up April 21 st Need to schedule exam review 4/7/2010 2 © Derek Chiou: EE360N: Lecture 20
Background image of page 2
Test of size Survey Results for Lecture 19 The lecture was clear Percent AnsweredAgree96.296%Little improvement required3.704%Some improvement required0%Significant improvement required0% Unanswered 0% Question 2: Multiple Choice The lecture was well organized Percent AnsweredAgree96.296%Little improvement required3.704%Some improvement required0%Significant improvement required0% Unanswered 0% Question 3: Multiple Choice The pace of the lecture was: Percent AnsweredWay too fast3.704%A little too fast14.815%Just right59.259%A little too slow22.222%Way too slow0% Unanswered 0% Question 4: Essay How could this lecture have been improved? What material should have been covered, or covered more clearly? What material should be removed? Any other comments are welcome. Unanswered Responses10 Given Answers The lecture flowed at the right pace and the examples helped understand better. Perfect lecture!The examples were great! More examples, please.-None at this point. having both examples of scoreboarding and tomasulo really helpedI thought we covered the examples a little too fast.Stepping through the execution on the board was helpful for me. I thought this was a very clear lecture!For all these examples of out of order execution you have only talked about arithmetic operations. what about branching and memory access instructions. where do they fit in? Could you do one example of these kinds of instructions along with the regular arithmetic ones ?There was a time constraint as to how many cycle-by-cycle examples we could do, but having more examples of scoreboarding and tomasulos on blackboard would help my understanding.I would like to know more about the choices to use one method over another. Very interesting.1) I accidentally filled out survey for Lecture 18 thinking it was for Lecture 17 since you had posted it before the lecture. 2)I guess the only way I can completely understand the algorithms (scoreboarding and Tomasulo) is by comparing them for a same problem. . I am still unable to appreciate the differences. It would be helpful if you could post some worked out example(s) on blackboard that will help us clearly see where each algorithm is better than the other. The animations used for the example hospital scenario (to explain Tomasulo) were nice. If you could do some similar animations for the actual algorithm, it would be very easy to visualize the sequence of operations that take place. Perhaps you could do that for the lectures in future semesters.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/23/2010 for the course EE 360n taught by Professor Staff during the Spring '08 term at University of Texas at Austin.

Page1 / 20

DerekChiou_EE360N_Spring2010_Lecture20 - Lecture 20: Branch...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online