Consider two set-associative cache architectures: WBC (write back policy) and WTC (write through policy). Both use LRU replacement. The cache is connected to main memory. Which of the following statements is/are TRUE?
A read miss in WBC never evicts a dirty block
A read miss in WTC never triggers a write back operation of a cache block to main memory
A write hit in WBC can modify the value of the dirty bit of a cache block
A write miss in WTC always writes the victim cache block to main memory before loading the missed block to the cache
Correct answer: (B) A read miss in WTC never triggers a write back operation of a cache block to main memory; (C) A write hit in WBC can modify the value of the dirty bit of a cache block
Explanation
A write-through cache never holds dirty blocks so a read miss never triggers a write back. In write-back, a write hit sets the dirty bit. A read miss in WBC can evict a dirty block, and WTC victims are never dirty.
More Memory Interfacing and Hierarchy questions
GATE 2024 CS (CS1) Q54– Consider a 512 GB hard disk with 32 storage surfaces. There are 4096 sectors per track and…
GATE 2024 CS (CS1) Q56– A given program has 25% load/store instructions. The ideal CPI without memory stalls is 2.…
GATE 2024 CS (CS2) Q53– Consider a disk with rotation speed of 6000 RPM, average seek time of 5 milliseconds, 500…
GATE 2023 CS Q42– A 4 kilobyte (KB) byte-addressable memory is realized using four 1 KB memory blocks. Two…
GATE 2023 CS Q64– An 8-way set associative cache of size 64 KB (1 KB = 1024 bytes) is used in a system with…
GATE 2022 CS Q24– Let WB and WT be two set associative cache organizations that use LRU algorithm for cache…