Bankers Algo Implementation
Download as TXT, PDF0 likes153 views
This C program implements the Banker's algorithm to check for safe sequences in a system with processes and resources. It takes input for the number of processes and resources, the maximum and allocated resources for each process, and available resources. It then calculates the need of each process and checks if the system is in a safe state by finding a sequence where all processes finish without causing another to wait indefinitely for resources. The program outputs the safe sequence or detects a deadlock if no such sequence exists.
![#include<stdio.h>
#include<conio.h>
void main()
{
int p,r,i,j,instanc,k=0,count1=0,count2=0; //count,k variables are taken
for counting purpose
int avail[10],max[10][10],allot[10][10],need[10][10],completed[10];
printf("nt Enter No. of Process:-n");
scanf("%d",&p); //Entering No. of Processes
printf("ntEnter No. of Resources:-n");
scanf("%d",&r); //No. of Resources
for(i=0;i<p;i++)
completed[i]=0; //Setting Flag for uncompleted Process
printf("ntEnter No. of Available Instancesn");
for(i=0;i<r;i++)
{
printf("tt");
scanf("%d",&instanc);
avail[i]=instanc; // Storing Available instances
}
printf("ntEnter Maximum No. of instances of resources that a Process
need:n");
for(i=0;i<p;i++)
{
printf("nt For P[%d]",i);
for(j=0;j<r;j++)
{
printf("t");
scanf("%d",&instanc);
max[i][j]=instanc;
}
}
printf("nt Enter no. of instances already allocated to process of a
resource:n");
for(i=0;i<p;i++)
{
printf("nt For P[%d]t",i);
for(j=0;j<r;j++)
{
printf("tt");
scanf("%d",&instanc);
allot[i][j]=instanc;
need[i][j]=max[i][j]-allot[i][j]; //calculating Need of each
process
}
}
printf("nt Safe Sequence is:- t");
while(count1!=p)
{
count2=count1;
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
if(need[i][j]<=avail[j])
{
k++;
}
}
if(k==r && completed[i]==0 )
{
printf("P[%d]t",i);
completed[i]=1;](https://image.slidesharecdn.com/bankers-150910173717-lva1-app6891/85/Bankers-Algo-Implementation-1-320.jpg)
![for(j=0;j<r;j++)
{
avail[j]=avail[j]+allot[i][j];
}
count1++;
}
k=0;
}
if(count1==count2)
{
printf("tt Stop ..After this.....Deadlock n");
break;
}
}
getch();
}](https://image.slidesharecdn.com/bankers-150910173717-lva1-app6891/85/Bankers-Algo-Implementation-2-320.jpg)
Bankers Algo Implementation
- 1. #include<stdio.h> #include<conio.h> void main() { int p,r,i,j,instanc,k=0,count1=0,count2=0; //count,k variables are taken for counting purpose int avail[10],max[10][10],allot[10][10],need[10][10],completed[10]; printf("nt Enter No. of Process:-n"); scanf("%d",&p); //Entering No. of Processes printf("ntEnter No. of Resources:-n"); scanf("%d",&r); //No. of Resources for(i=0;i<p;i++) completed[i]=0; //Setting Flag for uncompleted Process printf("ntEnter No. of Available Instancesn"); for(i=0;i<r;i++) { printf("tt"); scanf("%d",&instanc); avail[i]=instanc; // Storing Available instances } printf("ntEnter Maximum No. of instances of resources that a Process need:n"); for(i=0;i<p;i++) { printf("nt For P[%d]",i); for(j=0;j<r;j++) { printf("t"); scanf("%d",&instanc); max[i][j]=instanc; } } printf("nt Enter no. of instances already allocated to process of a resource:n"); for(i=0;i<p;i++) { printf("nt For P[%d]t",i); for(j=0;j<r;j++) { printf("tt"); scanf("%d",&instanc); allot[i][j]=instanc; need[i][j]=max[i][j]-allot[i][j]; //calculating Need of each process } } printf("nt Safe Sequence is:- t"); while(count1!=p) { count2=count1; for(i=0;i<p;i++) { for(j=0;j<r;j++) { if(need[i][j]<=avail[j]) { k++; } } if(k==r && completed[i]==0 ) { printf("P[%d]t",i); completed[i]=1;
- 2. for(j=0;j<r;j++) { avail[j]=avail[j]+allot[i][j]; } count1++; } k=0; } if(count1==count2) { printf("tt Stop ..After this.....Deadlock n"); break; } } getch(); }