Memory Management Flashcards

1
Q

Swapping

A

Processes swapped temporarily to a back store then brought back to memory for execution

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

Advantages of swapping

A

Increases degree of multiprogramming in a system

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

Contiguous allocation

A

Way of organizing program in memory where a program must exist as Contiguous adddreses

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

Compaction

A

Shuffle memory contents to place all free memory together in one large block (only when allocation is dynamic)

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

Requirements of Primary Memory

A
  • The primary memory access time must be as small as possible
  • The primary memory must be as large as possible
  • The primary memory must be cost effective
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Protection of memory space

A

Protection by using a pair of base and limit registers define the logical address space of a process

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

Hardware Address Protection

A

CPU must check every memory access generated in user mode to
be sure it is between base and limit for that user

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

Address Binding

A

Mapping and loading instructions and data to locations in RAM (main memory)

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

Address binding of instructions and data to memory addresses can
happen at three different stages, what are they?

A
  • Compile time: If memory location known a priori, absolute code can be generated; must recompile code if starting location changes
  • Load time: Must generate relocatable code if memory location is not known at compile time
  • Execution time: Binding delayed until run time if the process can be moved during its execution from one memory segment to another
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Logical vs. Physical Address Space

A
  • Logical address – generated by the CPU; also referred to as virtual address
  • Physical address – address seen by the memory unit
    *Logical and physical addresses are the same in compile-time and load time address-binding schemes; logical (virtual) and physical addresses differ in execution-time address-binding scheme
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Logical address space

A

Is the set of all logical addresses generated
by a program

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

Physical address space

A

Is the set of all physical addresses
generated by a program

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

Memory-Management Unit (MMU)

A

Hardware device that at run-time maps virtual to physical address

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

Fixed-Partition Strategy

A

Divide memory into N fixed size regions,
possibly of different sizes

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

Internal Fragmentation

A
  • Memory allocated to one process may be more than what it needs
  • Memory allocated to one process cannot be used by another, even if it is unused
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Variable-Partition Strategy

A

Allocate a process exactly what it
needs

17
Q

External Fragmentation

A
  • As system runs, memory may be fragmented between processes
  • The unused memory does not belong to any of the processes surrounding it
  • Total memory space may exist to satisfy a request, but it is not contiguous
18
Q
A