Tutorial 11, Final Review - ECSE 425 â Computer Organization and ...

More documents

Recommendations

Info

Loop unrolling●●●●We want to keep the pipeline fullReplicate the body of a loop multiple times tofind ILP <strong>and</strong> reduce the number of controldependencesThis technique yields larger executables,requires lots of registersWe don't always know if we can unroll a loopsince the upper bound is not always static
Branch prediction●●●No prediction: flushing, delayed branchStatic prediction: predict taken, not-takenDynamic prediction: use past behavior●●●●1-bit predictor: repeat past outcome2-bit predictor: repeat past outcome provided it hasoccurred at least twice in a rowCorrelating predictor: (m,n) predictor uses 2^m n-bitpredictors, depending on the outcome of the past mbranchesTournament predictor: two predictor – one local, oneglobal. Dynamically select between the two
Page 1 and 2: Tutorial 11Final Exam Review
Page 3 and 4: Trends in technology●●●Bandwi
Page 5 and 6: Trends in IC cost●Four equations
Page 7 and 8: Locality●A processor spends most
Page 9 and 10: Pipelining●●●Split an instruc
Page 11 and 12: Pipeline hazards●●●Structural
Page 14 and 15: Multicycle operations●The FP pipe
Page 16 and 17: Instruction-level parallelism●●
Page 20 and 21: Dynamic scheduling●Hardware rearr
Page 22 and 23: Tomasulo's algorithm
Page 24 and 25: Speculative Tomasulo(C) 2003 Elsevi
Page 26 and 27: Memory hierarchy●●●●●Memo
Page 28 and 29: Caches●●●●●Block placemen
Page 30 and 31: Caches●●●●Miss rateMulti-le
Page 32 and 33: Cache coherence protocols●●●
Page 34 and 35: Virtual memory●●●●Each prog
Page 36: Final exam● December 9 th at 9am

Tutorial 11, Final Review - ECSE 425 â Computer Organization and ...

Create successful ePaper yourself

Delete template?

Save as template?

Tutorial 11, Final Review - ECSE 425 â Computer Organization and ...