This preview shows page 1. Sign up to view the full content.
Unformatted text preview: e of locality to try to minimize the probability that the replaced line will be referenced in the near future. For example, a least-frequently-used (LFU) policy will replace the line that has been referenced the fewest times over some past time window. A least-recently-used (LRU) policy will replace the line that was last accessed the furthest in the past. All of these policies require additional time and hardware. But as we move further down the memory hierarchy, away from the CPU, the cost of a miss becomes more expensive and it becomes more worthwhile to minimize misses with good replacement policies. 6.4.4 Fully Associative Caches
A fully associative cache consists of a single set (i.e., Figure 6.35 shows the basic organization.
valid set 0: valid valid tag tag ••• tag cache block cache block cache block ) that contains all of the cache lines. E = C/B lines in the one and only set Figure 6.35: Fully set associative cache ( of the lines. ). In a fully associative cache, a single s...
View Full Document
This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.
- Spring '10
- The American