Scribd
Upload
10 views

Bankers Algorithm

The Banker's algorithm is used to detect deadlock in operating systems. It takes as input the allocation matrix, maximum matrix and available resources. It calculates the need of each process and checks if the need can be immediately met by available resources. If so, it allocates the resources to the process and updates available resources. This is repeated until all processes are in the safe sequence or an unsafe state is detected.

Uploaded by

adithya3538
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

Bankers Algorithm

The Banker's algorithm is used to detect deadlock in operating systems. It takes as input the allocation matrix, maximum matrix and available resources. It calculates the need of each process and checks if the need can be immediately met by available resources. If so, it allocates the resources to the process and updates available resources. This is repeated until all processes are in the safe sequence or an unsafe state is detected.

Uploaded by

adithya3538
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Bankers algorithm

Y.Baladithya
AP21110010210
Code:
#include <iostream>
using namespace std;
int main()
{
int n, m, i, j, k;
cout<<"Enter number of processes : "<<endl;
cin>>n;
cout<<"Enter number of resources: "<<endl;
cin>>m;
int alloc[n][m];
int max[n][m];
int avail[m];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;++j)
{
cout<<"Enter the allocation Matrix for "<<i+1<<"th
row ,"<<j+1<<"th coloum :"<<endl;
cin>>alloc[i][j];
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;++j)
{
cout<<"Enter the Max Matrix for "<<i+1<<"th
row ,"<<j+1<<"th coloum :"<<endl;
cin>>max[i][j];
}
}
for(int i=0;i<m;i++)
{
cout<<"Enter the available resources at "<<i+1<<"th Index :
"<<endl;
cin>>avail[i];
}
int f[n], ans[n], ind = 0;
for (k = 0; k < n; k++) {
f[k] = 0;
}
int need[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++)
need[i][j] = max[i][j] - alloc[i][j];
}
int y = 0;
for (k = 0; k < 5; k++) {
for (i = 0; i < n; i++) {
if (f[i] == 0) {
int flag = 0;
for (j = 0; j < m; j++) {
if (need[i][j] > avail[j]){
flag = 1;
break;
}
}

if (flag == 0) {
ans[ind++] = i;
for (y = 0; y < m; y++)
avail[y] += alloc[i][y];
f[i] = 1;
}
}
}
}

int flag = 1;

for(int i = 0;i<n;i++)
{ if(f[i]==0)
{
flag = 0;
cout << "The given sequence is not safe";
break;
}
}

if(flag==1)
{
cout << "Following is the SAFE Sequence" << endl;
for (i = 0; i < n - 1; i++)
cout << " P" << ans[i] << " ->";
cout << " P" << ans[n - 1] <<endl;
} return (0);
}
output

You might also like