Program and Algorithm of Best Fit in C++ || dot clu

Program  and Algorithm of Best Fit in C++ || dot clu

Best Fit Algorithm in C and C++

Memory Management is one of the services provided by OS which is needed for Optimized memory usage of the available memory in a Computer System.

Suggestion:

1.First Fit
2. Best Fit

3. Worst Fit

What is Best Fit Memory Management Scheme?

Best fit uses the best memory block based on the Process memory request. In best fit implementation the algorithm first selects the smallest block which can adequately fulfill the memory request by the respective process.

Because of this memory is utilized optimally but as it compares the blocks with the requested memory size it increases the time requirement and hence slower than other methods. It suffers from Internal Fragmentation which simply means that the memory block size is greater than the memory requested by the process, then the free space gets wasted.

Once we encounter a process that requests a memory which is higher than block size we stop the algorithm.

Best Fit Algorithm

1. Get no. of Processes and no. of blocks.
2. After that get the size of each block and process requests.
3. Then select the best memory block that can be allocated using the above definition.
4. Display the processes with the blocks that are allocated to a respective process.
5. Value of Fragmentation is optional to display to keep track of wasted memory.
6. Stop.

Source code:

1. #include<iostream>
2.  
3. using namespace std;
4.  
5. int main()
6. {
7.     int fragment[20],b[20],p[20],i,j,nb,np,temp,lowest=9999;
8.     static int barray[20],parray[20];
9.     cout<<"\n\t\t\tMemory Management Scheme - Best Fit";
10.     cout<<"\nEnter the number of blocks:";
11.     cin>>nb;
12.     cout<<"Enter the number of processes:";
13.     cin>>np;
14.     
15.     cout<<"\nEnter the size of the blocks:-\n";
16.     for(i=1;i<=nb;i++)
17.     {
18.         cout<<"Block no."<<i<<":";
19.         cin>>b[i];
20.     }
21.     
22.     cout<<"\nEnter the size of the processes :-\n";
23.     for(i=1;i<=np;i++)
24.     {
25.         cout<<"Process no. "<<i<<":";
26.         cin>>p[i];
27.     }
28.     
29.     for(i=1;i<=np;i++)
30.     {
31.         for(j=1;j<=nb;j++)
32.         {
33.             if(barray[j]!=1)
34.             {
35.                 temp=b[j]-p[i];
36.                 if(temp>=0)
37.                     if(lowest>temp)
38.                     {
39.                         parray[i]=j;
40.                         lowest=temp;
41.                     }
42.             }
43.         }
44.         
45.         fragment[i]=lowest;
46.         barray[parray[i]]=1;
47.         lowest=10000;
48.     }
49.     
50.     cout<<"\nProcess_no\tProcess_size\tBlock_no\tBlock_size\tFragment";
51.     for(i=1;i<=np && parray[i]!=0;i++)
52.         cout<<"\n"<<i<<"\t\t"<<p[i]<<"\t\t"<<parray[i]<<"\t\t"<<b[parray[i]]<<"\t\t"<<fragment[i];
53.     
54.     return 0;
55. }