Memory Hierarchy Primer Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What’s the current general trend with data locations?

A

The quicker the location is, the less space is available because it is more expensive.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

List the memory hierarchy levels

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Describe how a memory hierarchy works, in general

A
  • When you look for a variable in cache and you find it (cache hit), that means it is also stored in all subsequent levels of the memory hierarchy.
  • If you try to access a variable in a level and cannot find it (denoted as a miss), you will have to keep navigating the subsequent levels until you find it.
  • Then, you copy it to all the levels
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What’s temporal locality?

A

Cache recently accessed data. Idea: when you access a variable/data, you tend to access it again in the near future.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What’s Spatial locality?

A

Idea: if a program accesses a variable, it is also likely to access data that is stored in a nearby memory location

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Why is it important to consider where data is stored?

A

The CPU cycles are very short which tends to lead to applications being I/O bound. This necessarily leads to the CPU being idle for a lot of the time since a large portion of time will be spent reading or writing data.

With faster computation speed being the primary goal of new computer designs and components such as the CPU and memory being expensive, there is a strong imperative to avoid I/O bound states and eliminating them can yield a more economic improvement in performance than upgrading the CPU or memory.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly