Practice Cache Access Principles (7.3) - Caches - Computer Architecture

Practice: Cache Access Principles

Lesson 7.3Caches

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define spatial locality.
Show hintHide hint
It relates to how data is organized in the cache.
Question 2.
What is temporal locality?
Show hintHide hint
Think of a loop where the same data is read multiple times.
3Question 3.
What does spatial locality imply in caching?
- Access to random memory locations is common.
- Data accesses are concentrated in nearby memory.
- Only recently accessed data will be cached.
Show hintHide hint
Consider how data is organized in arrays.
4Question 4.
True or False: In a direct-mapped cache, multiple addresses can map to the same line, leading to cache misses.
- True
- False
Show hintHide hint
Think about how data locations are organized.
Question 5.
You are tasked with designing a cache for a system that experiences rapid data access in bursts followed by periods of inactivity. Which replacement policy would you choose, and why?
Show hintHide hint
Consider which policy focuses on usage history.
Question 6.
Given the following access pattern for memory addresses: 1, 2, 1, 3, 4, 2, 5, if implemented in a small 4-line direct-mapped cache, which addresses would likely cause conflicts?
Show hintHide hint
Calculate the cache lines for each address based on modulo operation.

5 more questions in this section. Enroll free to practise them all.