memory management Flashcards

1
Q

Memory management

A

is the functionality of an operating system which handles or manages primary memory and moves processes back and forth between main memory and disk during execution

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

Process Address Space

A

The process address space is the set of logical addresses that a process references in its code

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

static loading

A

Is loading an entire program into a fixed address

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

dynamic loading

A

dynamic routines of the library are stored on a disk in relocatable form and are loaded into memory only when they are needed by the program.

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

static linking

A

the linker combines all other modules needed by a program into a single executable program to avoid any runtime dependency.

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

dynamic linking

A

it is not required to link the actual module or library with the program, rather a reference to the dynamic module is provided at the time of compilation and linking

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

Memory allocation techniques

A

1.Swapping
2.Fragmentation
*internal and external
3.Paging
4.Segmentation
5.Contiguous Allocation
*Single-Contigous Allocation
*Fixed partitioning
*Dynamic partitioning
6.Virtual memory

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

Swapping

A

it is a process of temporarily inti secondary memory from main memory

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

Fragmentation

A

As processes are loaded and removed from memory, the free memory space is broken into little pieces. It happens after sometimes that processes cannot be allocated to memory blocks considering their small size and memory blocks remains unused

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

External fragmentation

A

Total memory space is enough to satisfy a request or to reside a process in it, but it is not contiguous, so it cannot be used

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

Internal fragmentation

A

Memory block assigned to process is bigger.
Some portion of memory is left unused, as it cannot be used by another process.

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

Paging

A

Is when process address space are broken into blocks of the same size

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

single contiguous allocation

A

the entire memory is allocated to a single process

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

fixed partitioning

A

memory is dived into fixed sizes ang is allocated to a single process

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

dynamic partitioning

A

memory is divided into variable sizes

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

disadvantages of paging

A

*Suffers from internal fragmentation
*Page table requires extra memory space, so may not be good for a system having small RAM.

13
Q

advantages of paging

A

reduces external fragmentation
it is easy to implement
it is easy to do swapping

13
Q

virtual memory

A

it allows processes to run even when main memory is finished up

13
Q

First In First Out (FIFO) Algorithm

A

Oldest page in main memory is the one which will be selected for replacement.

13
Q

Optimal Page Algorithm

A

Replace the page that will not be used for the longest period of time. Use the time when a page is to be used.

13
Q

Least Recently Used (LRU) Algorithm

A

Page which has not been used for the longest time in main memory is the one which will be selected for replacement

13
Q

segmentation

A

memory is divided into several segments of diff sizes

13
Q

Least Frequently Used (LFU) Algorithm

A
  • The page with the smallest count is the one which will be selected for replacement.
  • This algorithm suffers from the situation in which a page is used heavily during the initial phase of a process, but then is never used again
14
Q

objectives of memory

A

optimal utilization
isolation and protection
address space abstraction
fragment minimization