DerekChiou_EE360N_Spring2010_Lecture18

DerekChiou_EE360N_Spring2010_Lecture18 - Lecture 18:...

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

View Full Document Right Arrow Icon
© Derek Chiou 1 Lecture 18: Tomasulo’s Algorithm 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 17 Question 1: Multiple Choice The lecture was clear Percent AnsweredAgree77.778%Little improvement required22.222%Some improvement required0%Significant improvement required0% Unanswered 0% Question 2: Multiple Choice The lecture was well organized Percent AnsweredAgree88.889%Little improvement required5.556%Some improvement required5.556%Significant improvement required0% Unanswered 0% Question 3: Multiple Choice The pace of the lecture was: Percent AnsweredWay too fast0%A little too fast33.333%Just right55.556%A little too slow11.111%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 Nothing right now Scoreboarding seemed pretty clear.I the lecture was quite ok-This was a good introduction. I am hoping to get more familiar with the concepts during the next lecture.Scoreboarding is still rather unclearI understood the example of scoreboarding but the terminologies like dispatch, issue confused me and I found the initial part a bit unclear. 3/31/2010 © Derek Chiou: EE360N: Lecture 18 2
Background image of page 2
Test of size 3/31/2010 © Derek Chiou: EE360N: Lecture 18 3 Announcements, Recap and Outline Recap Scoreboarding Outline In class exercise Review scoreboarding Tomasulo’s Algorithm
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 3/31/2010 © Derek Chiou: EE360N: Lecture 18 4 Scoreboard Variation: Homework! Don’t dispatch/issue to functional unit until operands read and issued with instruction eliminates WAR simplifies scoreboard reduces parallelism ( why ?) What state is needed? What does control logic look like? Similar to our original multiple functional unit architecture
Background image of page 4
Test of size 3/31/2010 © Derek Chiou: EE360N: Lecture 18 5 Busy[unit#] : a bit-vector to indicate unit’s availability (Int, Add, Mult, Div) IsDest[reg#] : a bit-vector to record the registers reserved for write back Each instruction consults the scoreboard FU available? Not Busy[FU#] RAW? IsDest[src1] or IsDest[src2] WAR? cannot arise WAW? IsDest[dest] If no hazard is detected, set IsDest[dest]=true (Busy[unit#] is hardwired to the FU’s busy signal) Upon writing back, set IsDest[dest]=false Scoreboard Variation Solution
Background image of page 5

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

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

Page1 / 28

DerekChiou_EE360N_Spring2010_Lecture18 - Lecture 18:...

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

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