Dynamic Partitioning | Contiguous Memory Management | OS | Lec-16 | Bhanu Priya

Operating system ( OS )
Dynamic partitioning : Placement algorithms with example

Class Notes ( pdf )

[omarhasan]

Here Dynamic partition has been explained in the wrong way!

The real Concept is:

Initially, memory is not partitioned for processes.
Initially, all memory is available for user processes and is considered as one large block of available memory, a Hole.

When processes arrive, then memory is partitioned contiguously according to the process size and again available space is left as one big Hole for upcoming processes.
And this goes on until all the RAM is occupied by processes.

When a process completes its execution and is terminated, the info of that released memory space is stored as Hole in a table maintained by OS, for upcoming processes.

And these Holes are filled by processes using the following methods-
1. First Fit
2. Next Fit
3. Best Fit
4. Worst Fit

[naveenrajiti]

Thank you Mam, which algorithm is best for efficient use of memory allocation
Because text book having first fit is best algorithm, but best fit algorithm is best in others source

[rezwanchowdhury]

3M on 4M is both first fit and best fit!

[munafhussain]

Mam in dynamic partition process are allotted memory when they arrived so so there is no size is mention for partition so how to use fix partition best partition and worse partition , i am confuse😫😫

[drrrw]

Talking about holes it something I like.

[prasadpalupuri]

Madam say abount dynamic loading and linking

[dexterhudson]

Thank you so much! This was a perfect explanation!

[mdibrahim]

First clear your doubt then explain us 😒

[kokilavanil]

Worst of teaching i cant understand this topic