Scribd
Upload
63 views5 pages

Partitioning Algorithms

The document discusses four partitioning algorithms used by operating systems: First Fit, Next Fit, Best Fit, and Worst Fit. First Fit scans for the first hole big enough for a process. Next Fit scans from where the previous allocation was made. Best Fit finds the smallest possible hole, but results in small unused holes. Worst Fit finds the largest hole, but is slow searching the entire list each time.

Uploaded by

Anamika Dewedi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
63 views5 pages

Partitioning Algorithms

The document discusses four partitioning algorithms used by operating systems: First Fit, Next Fit, Best Fit, and Worst Fit. First Fit scans for the first hole big enough for a process. Next Fit scans from where the previous allocation was made. Best Fit finds the smallest possible hole, but results in small unused holes. Worst Fit finds the largest hole, but is slow searching the entire list each time.

Uploaded by

Anamika Dewedi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 5

Partitioning Algorithms

BY-Anamika
 Partitioning Algorithms
• There are various algorithms which are
implemented by the Operating System in
order to find out the holes in the linked list
and allocate them to the processes.
• The explanation about each of the algorithm is
given below.
1. First Fit Algorithm
• First Fit algorithm scans the linked list and whenever it finds the first big enough hole to
store a process, it stops scanning and load the process into that hole. This procedure
produces two partitions. Out of them, one partition will be a hole while the other
partition will store the process.
• First Fit algorithm maintains the linked list according to the increasing order of starting
index. This is the simplest to implement among all the algorithms and produces bigger
holes as compare to the other algorithms.
2. Next Fit Algorithm
• Next Fit algorithm is similar to First Fit algorithm except the fact that, Next fit scans the
linked list from the node where it previously allocated a hole.
• Next fit doesn't scan the whole list, it starts scanning the list from the next node. The idea
behind the next fit is the fact that the list has been scanned once therefore the probability
of finding the hole is larger in the remaining part of the list.
• Experiments over the algorithm have shown that the next fit is not better then the first fit.
So it is not being used these days in most of the cases.
3. Best Fit Algorithm
• The Best Fit algorithm tries to find out the smallest hole possible in
the list that can accommodate the size requirement of the process.
• Using Best Fit has some disadvantages.
1. It is slower because it scans the entire list every time and tries to find
out the smallest hole which can satisfy the requirement the process.
2.Due to the fact that the difference between the whole size and the
process size is very small, the holes produced will be as small as it
cannot be used to load any process and therefore it remains useless.
Despite of the fact that the name of the algorithm is best fit, It is not
the best algorithm among all.
4. Worst Fit Algorithm
• The worst fit algorithm scans the entire list every
time and tries to find out the biggest hole in the list
which can fulfill the requirement of the process.
• Despite of the fact that this algorithm produces the
larger holes to load the other processes, this is not
the better approach due to the fact that it is slower
because it searches the entire list every time again
and again.

You might also like