8.3 Memory Hierarchy and Caches Flashcards

1
Q

What does a von Neumann architecture imply about the storage of programs

A

Stored in memory (potential to cache instructions)

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

Compare SRAM to DRAM

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

How does SRAM, DRAM, HDD etc. compare in relation to cost and cycles

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

How long is a nanosecond

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

What are the memory tradeoffs

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

What is a cache

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

What is the purpose of an instruction cache

A
  • Store frequently used instructions and instruction blocks
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Are caches determined by the ISA or micro-architecture?

A

Micro-architecture (ISA just sees a flat memory space)

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

What is the cache level hierarchy

A

L3 is usually shared

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

What are inclusive / exclusive caches and how are they typically used

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

How does cache inclusivity work

A

Replicated, but when evicted stays in high level

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

What is the memory hierarchy

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

What is a working set (memory)

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

What are cache blocks

A

Set of words transfered at once:
* Little additional cost to transfer additional words.
* Already paid the latency cost for memory access with first word.
* High probability the rest of block will be needed anyway.

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

What is locality (and types: time, space)

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

What is temporal locality (memory)

A

Commonly accessed address => store data

17
Q

What is spatial locality (memory)

A

Close data is more often used => cache blocks

18
Q

What is a cache hit / miss

A
19
Q

How does a tag store work

A

Used to determine what is in cache. Tags are most sig bits, index is the least sig.

19
Q

What is a direct mapped cache

A

Use modulo to map RAM to cache. (if conflict remove last)

20
Q

What is a valid / modify bit (cache)

A

Valid: true copy. Modify: Need writeback

21
Q
A

Least to most sig: Word indexing within block, indexing within cache, tag to check if same.