Question
Let and be two set associative cache organizations that use LRU algorithm for cache block replacement. is a write back cache and is a write through cache. Which of the following statements is/are FALSE?
Official answer and solution
- Official answer
- A, B and D
- From
- Official GATE 2022 answer key
Solution
Identify the false statements regarding write-through () and write-back () cache policies.
Let us check each statement to determine which are FALSE:
- (A) FALSE: A dirty bit indicates that a cache block has been modified relative to main memory. In a write-through cache (), memory is updated synchronously on every write, so blocks in are never dirty, and does not require dirty bits.
- (B) FALSE: In a write-back cache (), a write hit only updates the cache block and sets its dirty bit to 1; data is not written to main memory until that block is evicted.
- (C) TRUE: Since always maintains consistency with main memory, evicting a block from never requires writing data back to main memory.
- (D) FALSE: A read miss in requires loading a new block into a cache set. If all lines in the set are occupied, the LRU replacement policy may select a dirty block for eviction, which must be written back to main memory.
Since the question asks for FALSE statements, the correct options are (A), (B), and (D).
Options (A), (B), (D)
Selecting the TRUE statement (C) instead of the FALSE statements requested by the question.
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2022 Computer Science and Information Technology (CS)
- Question
- 24 of 65
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.