Set associative cache. Consider a 4-way set associative cache of size 8 (blocks)

Question

Set associative cache. Consider a 4-way set associative cache of size 8 (blocks). This cache has two sets: set0 and set1 (p.481). (Quiz: How many blocks are in each set?) The cache uses the least recently used (LRU) scheme for block replacement on cache misses. Initially, the cache is empty. For each memory access in the sequence below, show whether it is a hit or miss, which block it fills or replaces, and the contents of the entire cache. a. block 00 b. block 07 c. block 06 d. block 04 e. block 00 f. block 02 g. block 12 h. block 07 i. block 02 j. block 08

Explanation / Answer

No.of blocks are in each set =4

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.