L1 and larger L2 form an inclusive cache hierarchy. S1: Read misses in a write-through L1 never cause dirty-line writebacks to L2. S2: Write-allocate must be used with write-through and no-write-allocate with writeback. Which are true?
Write-through immediately propagates L1 writes, so L1 has no dirty modified-only copies needing writeback on a read-miss replacement. Thus S1 is true. Allocation on a write miss is a separate policy choice; the asserted mandatory pairing in S2 is false, and common pairings are often the opposite. Answer A.
More Memory Interfacing and Hierarchy questions
GATE 2026 CS (CS1) Q38– The size of the physical address space of a processor is 232 bytes. The capacity of a…
GATE 2026 CS (CS2) Q52– Consider a system with a processor and a 4 KB direct-mapped cache with block size 16…
GATE 2026 CS (CS2) Q56– Consider a system with 1 MB physical memory and word length 1 byte. The system uses a…
GATE 2025 CS (CS1) Q36– Consider a memory system with 1M bytes of main memory and 16K bytes of cache memory.…
GATE 2025 CS (CS1) Q53– A computer has a memory hierarchy consisting of two-level cache (L1 and L2) and a main…
GATE 2025 CS (CS2) Q55– Given a computing system with two levels of cache (L1 and L2) and a main memory. The first…