Memory Partition Techniques Flashcards
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.
Fixed Partitioning
The partitions are created dynamically, wherein each process is loaded into a partition of exactly the same size as the process.
Dynamic Partitioning
Three (3) possible placement algorithms that can be considered in implementing dynamic partitioning
- Best-fit
- First-fit
- Next-fit
This chooses the block that is closest to the requested size
Best-fit
This scans the memory from the beginning and chooses the first available block that is large enough to cater the process.
First-fit
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.
Next-fit
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.
Simple Paging
Each process is divided into a number of segments, where in a process is loaded by adding all of its segments into dynamic partitions.
Simple Segmentation