Memory Management Flashcards

1
Q

What are the 5 problems with managing memory?

A
  1. Protection
  2. Relocation
  3. Room for Growth
  4. Fragmentation
  5. Allocation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Protection Includes:

A

Accidental/Intentional Clobbering
- write memory from another job
- read value from uncontrolled memory

Resolutions
- correct relocation
- protection words (IBM/360)
- base/limit registers (CDC 6600, intel 8080)

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

Contiguously Allocated

A

process is stored in a single block of memory.

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

Relocation Includes:

A

Memory Location
- process memory start is not static
- memory start is not predictable

Resolutions
- make and change all jumps during loading
- linker must ID all jumps

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

Room for Growth includes:

A

Allocate growth space
- stack for calls
- heap for dynamic variables

Swap what is used
- if we haven’t used space, don’t save it.

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

Fragmentation Includes:

A

External
- wasted space is not contiguous
- total space exists to satisfy a request

Internal
- wasted space inside allocated partition.
-allocated memory may be slightly larger than requested memory.

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

Allocation includes:

A

Bitmapped Memory
- Table of memory “Chunks”
* 1 = occupied
0 = unused
- Size of chunk
* Large chunk = small map,
low utilization
* Small chunk = large map,
high utilization
- Searching map is slow

List Memory
- Allocation (algorithms for
fining free space)
* First fit
* Best fit

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

What is paging?

A

Paging breaks the virtual address space into fixed sized pieces and physical address space into pieces of the same size.

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

What is the difference between pages and frames.

A

Pages break into virtual memory while frames break into physical memory.

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

Attempting to access a page that is not stored in physical memory is called a __________ .

A

Page Fault

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

A ________ is a small, fast memory that speeds up memory access time.

A

Cache

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

What states that if we have accessed a memory location before, we are likely to access it again soon.

A

Locality

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