Assume a 2-way set associative cache with 4 blocks. To solve the problems in thi

Question

Assume a 2-way set associative cache with 4 blocks. To solve the problems in this exercise, you may find it helpful to draw a table like the one below, as demonstrated for the address sequence "0, 1, 2, 3, 4." 4. Contents of Cache Blocks After Reference Set 0 Mem(O] Mem[O] Mem[O] Mem[O] Mem[4] Address of MemorY Evicted Block Accessed Hit or MissBlock Set 0 Set 1 Set 1 0 1 2 Miss Miss Miss Miss Miss Mem[2] Mem[2] Mem[2] Mem(1] Mem(1] Memi1] Mem(3] Mem[1] Mem(3] 4 0 Consider the following address sequence: 0, 2, 4, 8, 10, 12, 14, 16,0

Explanation / Answer

C) To do this address sequence exhibit if we will follow a random replacement policy by flipping a coin we need

            a. 3 hits or fewer

            b. 3 hits or fewer

D) To do this address sequence exhibit if we will follow this optimal policy we need

            a. 3 hits

            b. 3 hits

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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