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?
Each cache block in WB and WT has a dirty bit.
Every write hit in WB leads to a data transfer from cache to main memory.
Eviction of a block from WT will not lead to data transfer from cache to main memory.
A read miss in WB will never lead to eviction of a dirty block from WB.
Correct answer: (A) Each cache block in WB and WT has a dirty bit.; (B) Every write hit in WB leads to a data transfer from cache to main memory.; (D) A read miss in WB will never lead to eviction of a dirty block from WB.
Explanation
A is false because write-through needs no dirty bit. B is false because write-back defers the write until eviction. D is false because a read miss can evict a dirty block, which is then written back. C is true.
More Memory Interfacing and Hierarchy questions
GATE 2022 CS Q33– A cache memory that has a hit rate of 0.8 has an access latency 10 ns and miss penalty 100…
GATE 2022 CS Q54– Consider a system with 2 KB direct mapped data cache with a block size of 64 bytes. The…
GATE 2021 CS (CS1) Q32– Consider a computer system with a byte-addressable primary memory of size 232 bytes.…
GATE 2020 CS Q30– If there are m input lines and n output lines for a decoder that is used to uniquely…
GATE 2020 CS Q31– A direct mapped cache memory of 1 MB has a block size of 256 bytes. The cache has an…
GATE 2020 CS Q40– A computer system with a word length of 32 bits has a 16 MB byte-addressable main memory…