Memory Partition Techniques Flashcards

1
Q

The main memory is divided into a number of static partitions at systems generation time, wherein a process may be loaded into a partition of equal or greater size. Nowadays, the used of fixed partitioning is uncommon in the industry.

A

Fixed Partitioning

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

The partitions are created dynamically, wherein each process is loaded into a partition of exactly the same size as the process.

A

Dynamic Partitioning

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

Three (3) possible placement algorithms that can be considered in implementing dynamic partitioning

A
  • Best-fit
  • First-fit
  • Next-fit
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

This chooses the block that is closest to the requested size

A

Best-fit

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

This scans the memory from the beginning and chooses the first available block that is large enough to cater the process.

A

First-fit

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

This scans the memory from the location of the last placement and chooses the next available block that is large enough to cater to the process.

A

Next-fit

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

The memory is divided into a number of equally sized frames, which each process is divided into a number of equally sized pages of the same length as the frames.

Then, a process is loaded by adding all of its pages into available frames.

A

Simple Paging

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

Each process is divided into a number of segments, where in a process is loaded by adding all of its segments into dynamic partitions.

A

Simple Segmentation

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