Let WB and WT be two set associative cache organizations that use LRU…

PYQ GATE 2022

Let WB and WT be two set associative cache organizations that use LRU algorithm for cache block replacement. WB is a write back cache and WT is a write through cache. Which of the following statements is/are FALSE?

  1. A.

    Each cache block in WB and WT has a dirty bit.

  2. B.

    Every write hit in WB leads to a data transfer from cache to main memory.

  3. C.

    Eviction of a block from WT will not lead to data transfer from cache to main memory.

  4. D.

    A read miss in WB will never lead to eviction of a dirty block from WB.

Attempted by 199 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…