Week 10 Flashcards

1
Q

True / False:

You can increase a cache speed by adding another cache

A

True

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

how does cache performance relate to random sequences?

A

The more random a sequence, the worse a cache behaves.
The less random a sequence, the better a cache behaves

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

Three rules of memory hierarchy

A

1) lowest level is the ultimate repository for all information long-term
2) a level above is provided a copy of information from the level below when the level above cannot satisfy a processor memory access
3) when processor stores (writes) information into the top level, that change must eventually propagate down the levels to maintain rule 1

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

what is a block?

A

contains sequential word addresses, it’s size is a power of 2 multiple of general purpose register size

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

Compulsory Miss

A

name for the miss that must occur on the first access to a memory block

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

Capacity Miss

A

occurs when the cache cannot simultaneously hold all blocks accessed by a program (90/10 rule)

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

Conflict Miss:

A

occurs when a set has fewer block storage locations that the number of blocks mapping to that set for a given program temporo-spatial locality

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

how does a fully associative cache have no conflict misses?

A

it is eliminated if you can place any block in any block storage location: Set # field is eliminated, search cache for a block using only the tag field.

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

When do you use fully associative cache?

A

When conflict misses dominate (out of the 3 Cs) and when miss penalty is enormous

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

what is the dirty bit?

A

a bit that marks changed blocks for later write-back

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

you should move through multi-dimensional arrays in _____ order

A

storage

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

what are the virtual memory motivations:

A

Provide a convenient memory address environment
allow efficient and safe [correct] sharing of memory among multiple programs
use main memory as a cache for hard disk content
speed some operating system tasks

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

a separate range of addresses accessible only to this program:

A

Address space

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

Virtual memory system implements the _____ of a program’s address space to physical addresses used in main memory in the computer

A

translation (which enforces protection of a program’s address space from other programs)

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

virtual memory block is called a _____

A

page

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

virtual memory miss is called a _____

A

page fault

17
Q

what element information is stored for a page table array?

A

Resident and Dirty Bits, k-bit page frame number, j-bit page-describing metadata

18
Q

a page currently in main memory is called a _____ bit

A

Resident