- Asked 2/22
- 2076 Asoj · 2 marks
Why direct mapping needs no replacement
Short answer
In direct mapping each memory block maps to exactly one cache line (block mod number of lines). On a miss the incoming block must replace the block in that specific line; there is no choice among multiple lines, so no replacement algorithm is needed.
Give reasons why a replacement algorithm is not required in the direct mapping technique.
In direct mapping each main-memory block can be placed in only one fixed cache line, given by line = block mod number of lines. When a miss occurs, the new block must go to that one line, and whatever block is there is simply overwritten. There is no choice between several candidate lines, so no replacement algorithm is needed to select a victim. The decision is already made by the mapping function itself.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Associative mapping and replacement algorithms · Computer Organization and Architecture, chapter 6 · asked 2×
- Mapping function and replacement algorithm · Computer Organization and Architecture, chapter 6
- Replacement algorithm in associative mapping · Computer Organization and Architecture, chapter 6
- Direct cache mapping · Computer Organization and Architecture, chapter 6 · asked 3×
- Direct mapping with 32-block memory, 10 blocks used · Computer Organization and Architecture, chapter 6 · asked 3×
- Direct mapping with 64-block memory, 10 blocks used · Computer Organization and Architecture, chapter 6 · asked 3×
- Cache read and direct-mapping demerits · Computer Organization and Architecture, chapter 6
- Reasons for replacement; strategy from AEC table · Engineering Economics, chapter 5 · asked 2×
- Cache write policy and replacement algorithm · Embedded System, chapter 4
- Algorithm for numbers divisible by 9 not 6 · Computer Programming, chapter 2
- DC series motor should not start on no-load · Electrical Machines, chapter 4
All Computer Organization and Architecture chapter 6 questions →