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

More documents

Recommendations

Info

Memory hierarchy●●●●●Memory performance has not increased asquickly as processor performanceWe would like an unlimited amount of very fastmemory, but it's not feasiblePrinciple of locality: temporal/spatialHierarchy of memories, progressively larger butslower, organized in levelsMultiple levels of cache down to main memory●Hit/miss in a cache
Memory hierarchy●●●Memory accesses per instruction: to fetch theinstruction <strong>and</strong> (possibly) load/store to memoryMiss penalty: how many CC to get the datafrom a slower memoryMiss rate: how often you miss in a cache
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 18 and 19: Loop unrolling●●●●We want t
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 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 ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?

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