DerekChiou_EE360N_Spring2010_Lecture19

DerekChiou_EE360N_Sp - Lecture 19 Tomasulo vs Scoreboarding Prof Derek Chiou University of Texas at Austin Derek Chiou 1 Test of size Survey

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

View Full Document Right Arrow Icon
© Derek Chiou 1 Lecture 19: Tomasulo vs Scoreboarding 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 Survey Results for Lecture 18 The lecture was clear Percent AnsweredAgree87.5%Little improvement required12.5%Some improvement required0%Significant improvement required0% Unanswered 0% Question 2: Multiple Choice The lecture was well organized Percent AnsweredAgree100%Little improvement required0%Some improvement required0%Significant improvement required0% Unanswered 0% Question 3: Multiple Choice The pace of the lecture was: Percent AnsweredWay too fast4.167%A little too fast25%Just right62.5%A little too slow8.333%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 AnswersMost of the topics covered in the lecture was clear.Everything was good Very good lecture. I did not fully agree that scoreboarding offers any significant advantage over tomasulo's algorithm. Could you please give some specific details where scoreborading is advantageous except for being centralized. Maybe run through a more complex example of tomasulas. Nothing right nowI feel these topics are sinking in slower than others we have approached in this class The survey just after class is nice . Also, to sum it up in a crude way, can we say that scoreboarding --> Tomasulo algorithm if we no. of registers --> infinity/very large ?-None at this timeThe lecture was clear 4/5/2010 © Derek Chiou: EE360N: Lecture 19 2
Background image of page 2
Test of size 4/5/2010 © Derek Chiou: EE360N: Lecture 19 3 Recap and Outline Recap Finish Scoreboarding Started Tomasulo’s algorithm Outline Finish Tomasulo Tomasulo vs Scoreboarding Out-of-order completion Branch prediction
Background image of page 3

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

View Full DocumentRight Arrow Icon
Test of size 4/5/2010 © Derek Chiou: EE360N: Lecture 19 4 Tomasulo Dispatch/Issue/Execute/Complete If reservation station available before renaming Instruction + renamed operands (source value/tag) to reservation station Only rename if reservation station is available
Background image of page 4
Image of page 5
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_Sp - Lecture 19 Tomasulo vs Scoreboarding Prof Derek Chiou University of Texas at Austin Derek Chiou 1 Test of size Survey

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

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