Program for Next Fit algorithm in Memory Management

Prerequisite: Partition allocation methods
What is Next Fit ?
Next fit is a modified version of ‘first fit’. It begins as the first fit to find a free partition but when called next time it starts searching from where it left off, not from the beginning. This policy makes use of a roving pointer. The pointer moves along the memory chain to search for a next fit. This helps in, to avoid the usage of memory always from the head (beginning) of the free block chain.

What are its advantage over first fit ?

  • First fit is a straight and fast algorithm, but tends to cut large portion of free parts into small pieces due to which, processes that need a large portion of memory block would not get anything even if the sum of all small pieces is greater than it required which is so-called external fragmentation problem.
  • Another problem of the first fit is that it tends to allocate memory parts at the beginning of the memory, which may lead to more internal fragments at the beginning. Next fit tries to address this problem by starting the search for the free portion of parts not from the start of the memory, but from where it ends last time.
  • Next fit is a very fast searching algorithm and is also comparatively faster than First Fit and Best Fit Memory Management Algorithms.
Example:
Input :  blockSize[] = {5, 10, 20};
     processSize[] = {10, 20, 30};
Output:
Process No.     Process Size    Block no.
 1              10              2
 2              20              3
 3              30              Not Allocated

Algorithm:



  1. Input the number of memory blocks and their sizes and initializes all the blocks as free.
  2. Input the number of processes and their sizes.
  3. Start by picking each process and check if it can be assigned to the current block, if yes, allocate it the required memory and check for next process but from the block where we left not from starting.
  4. If the current block size is smaller then keep checking the further blocks.

Next-Fit

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C/C++ program for next fit
// memory management algorithm
#include <bits/stdc++.h>
using namespace std;
  
// Function to allocate memory to blocks as per Next fit
// algorithm
void NextFit(int blockSize[], int m, int processSize[], int n)
{
    // Stores block id of the block allocated to a
    // process
    int allocation[n], j = 0;
  
    // Initially no block is assigned to any process
    memset(allocation, -1, sizeof(allocation));
  
    // pick each process and find suitable blocks
    // according to its size ad assign to it
    for (int i = 0; i < n; i++) {
  
        // Do not start from beginning
        while (j < m) {
  
            if (blockSize[j] >= processSize[i]) {
  
                // allocate block j to p[i] process
                allocation[i] = j;
  
                // Reduce available memory in this block.
                blockSize[j] -= processSize[i];
  
                break;
            }
  
            // mod m will help in traversing the blocks from
            // starting block after we reach the end. 
            j = (j + 1) % m;
        }
    }
  
    cout << "\nProcess No.\tProcess Size\tBlock no.\n";
    for (int i = 0; i < n; i++) {
        cout << " " << i + 1 << "\t\t" << processSize[i] 
             << "\t\t";
        if (allocation[i] != -1)
            cout << allocation[i] + 1;
        else
            cout << "Not Allocated";
        cout << endl;
    }
}
  
// Driver program
int main()
{
    int blockSize[] = { 5, 10, 20 };
    int processSize[] = { 10, 20, 5 };
    int m = sizeof(blockSize) / sizeof(blockSize[0]);
    int n = sizeof(processSize) / sizeof(processSize[0]);
  
    NextFit(blockSize, m, processSize, n);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program for next fit
// memory management algorithm
import java.util.Arrays;
  
public class GFG {
  
// Function to allocate memory to blocks as per Next fit
// algorithm
    static void NextFit(int blockSize[], int m, int processSize[], int n) {
        // Stores block id of the block allocated to a
        // process
        int allocation[] = new int[n], j = 0;
  
        // Initially no block is assigned to any process
        Arrays.fill(allocation, -1);
  
        // pick each process and find suitable blocks
        // according to its size ad assign to it
        for (int i = 0; i < n; i++) {
  
            // Do not start from beginning
            while (j < m) {
  
                if (blockSize[j] >= processSize[i]) {
  
                    // allocate block j to p[i] process
                    allocation[i] = j;
  
                    // Reduce available memory in this block.
                    blockSize[j] -= processSize[i];
  
                    break;
                }
  
                // mod m will help in traversing the blocks from
                // starting block after we reach the end. 
                j = (j + 1) % m;
            }
        }
  
        System.out.print("\nProcess No.\tProcess Size\tBlock no.\n");
        for (int i = 0; i < n; i++) {
            System.out.print( i + 1 + "\t\t" + processSize[i]
                    + "\t\t");
            if (allocation[i] != -1) {
                System.out.print(allocation[i] + 1);
            } else {
                System.out.print("Not Allocated");
            }
            System.out.println("");
        }
    }
  
// Driver program
    static public void main(String[] args) {
        int blockSize[] = {5, 10, 20};
        int processSize[] = {10, 20, 5};
        int m = blockSize.length;
        int n = processSize.length;
        NextFit(blockSize, m, processSize, n);
    }
}
  
// This code is contributed by Rajput-Ji

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program for next fit 
# memory management algorithm 
  
# Function to allocate memory to
# blocks as per Next fit algorithm 
def NextFit(blockSize, m, processSize, n):
      
    # Stores block id of the block 
    # allocated to a process 
  
    # Initially no block is assigned 
    # to any process 
    allocation = [-1] *
    j = 0
  
    # pick each process and find suitable blocks 
    # according to its size ad assign to it 
    for i in range(n):
  
        # Do not start from beginning 
        while j < m:
  
            if blockSize[j] >= processSize[i]:
  
                # allocate block j to p[i] process 
                allocation[i] =
  
                # Reduce available memory in this block. 
                blockSize[j] -= processSize[i] 
  
                break
  
            # mod m will help in traversing the 
            # blocks from starting block after 
            # we reach the end. 
            j = (j + 1) % m
  
    print("Process No. Process Size Block no."
    for i in range(n):
        print(i + 1, "         ", processSize[i],
                                    end = "     ")
        if allocation[i] != -1:
            print(allocation[i] + 1
        else:
            print("Not Allocated")
  
# Driver Code
if __name__ == '__main__'
    blockSize = [5, 10, 20]
    processSize = [10, 20, 5
    m = len(blockSize)
    n = len(processSize)
  
    NextFit(blockSize, m, processSize, n)
      
# This code is contributed by PranchalK

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program for next fit 
// memory management algorithm 
using System;
using System.Linq;
public class GFG { 
  
// Function to allocate memory to blocks as per Next fit 
// algorithm 
    static void NextFit(int []blockSize, int m,
                            int []processSize, int n) { 
        // Stores block id of the block allocated to a 
        // process 
        int []allocation = new int[n];
        int j = 0; 
  
        // Initially no block is assigned to any process 
        Enumerable.Repeat(-1, n).ToArray();
  
        // pick each process and find suitable blocks 
        // according to its size ad assign to it 
        for (int i = 0; i < n; i++) { 
  
            // Do not start from beginning 
            while (j < m) { 
  
                if (blockSize[j] >= processSize[i]) { 
  
                    // allocate block j to p[i] process 
                    allocation[i] = j; 
  
                    // Reduce available memory in this block. 
                    blockSize[j] -= processSize[i]; 
  
                    break
                
  
                // mod m will help in traversing the blocks from 
                // starting block after we reach the end. 
                j = (j + 1) % m; 
            
        
  
        Console.Write("\nProcess No.\tProcess Size\tBlock no.\n"); 
        for (int i = 0; i < n; i++) { 
            Console.Write( i + 1 + "\t\t" + processSize[i] 
                    + "\t\t"); 
            if (allocation[i] != -1) { 
                Console.Write(allocation[i] + 1); 
            } else
                Console.Write("Not Allocated"); 
            
            Console.WriteLine(""); 
        
    
  
// Driver program 
    static public void Main() { 
        int []blockSize = {5, 10, 20}; 
        int []processSize = {10, 20, 5}; 
        int m = blockSize.Length; 
        int n = processSize.Length; 
        NextFit(blockSize, m, processSize, n); 
    
  
/*This code is contributed by Rajput-Ji*/

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program for next fit
// memory management algorithm
  
// Function to allocate memory to blocks as per Next fit
// algorithm
function NextFit($blockSize, $m, $processSize, $n)
{
    // Stores block id of the block allocated to a
    // process
    $allocation = array_fill(0, $n, -1);
    $j = 0;
  
    // Initially no block is assigned to any process above
  
    // pick each process and find suitable blocks
    // according to its size ad assign to it
    for ($i = 0; $i < $n; $i++)
    {
  
        // Do not start from beginning
        while ($j < $m)
        {
  
            if ($blockSize[$j] >= $processSize[$i]) 
            {
  
                // allocate block j to p[i] process
                $allocation[$i] = $j;
  
                // Reduce available memory in this block.
                $blockSize[$j] -= $processSize[$i];
  
                break;
            }
  
            // mod m will help in traversing the blocks from
            // starting block after we reach the end. 
            $j = ($j + 1) % $m;
        }
    }
  
    echo "\nProcess No.\tProcess Size\tBlock no.\n";
    for ($i = 0; $i < $n; $i++)
    {
        echo " ".($i + 1)."\t\t".$processSize[$i]."\t\t";
        if ($allocation[$i] != -1)
            echo ($allocation[$i] + 1);
        else
            echo "Not Allocated";
        echo "\n";
    }
}
  
    // Driver program
    $blockSize = array( 5, 10, 20 );
    $processSize = array( 10, 20, 5 );
    $m = count($blockSize);
    $n = count($processSize);
  
    NextFit($blockSize, $m, $processSize, $n);
  
  
// This code is contributed by mits
?>

chevron_right


Output:

Process No.    Process Size    Block no.
 1               10              2
 2               20              3
 3               5               1

This article is contributed by Akash Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up