Cache Performance and Set Associative Cache
Cache Performance and Set Associative CacheLecture 12CDA 310306-30-2014Chapter 5 Large and Fast: Exploiting Memory Hierarchy 2Principle of Locality Programs access a small proportion of their address space at any time Temporal locality Items accessed recently are likely to be accessed again soon , instructions in a loop, induction variables Spatial locality Items near those accessed recently are likely to be accessed soon , sequential instruction access, array data IntroductionChapter 5 Large and Fast: Exploiting Memory Hierarchy 3Memory Hierarchy Levels Block (aka line): unit of copying May be multiple words If accessed data is present in upper level Hit: access satisfied by upper level Hit ratio: hits/accesses If accessed data is absent Miss: block copied from lower level Time taken: miss penalty Miss ratio: misses/acc
Jun 30, 2014 · Chapter 5 —Large and Fast: Exploiting Memory Hierarchy —36 How Much Associativity Increased associativity decreases miss rate But with diminishing returns Simulation of a system with 64KB D-cache, 16-word blocks, SPEC2000 1-way: 10.3% 2-way: 8.6% 4-way: 8.3% 8-way: 8.1%
Download Cache Performance and Set Associative Cache
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: