Scribd
Upload
11 views6 pages

P 9

prac

Uploaded by

chintupatel2672
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
11 views6 pages

P 9

prac

Uploaded by

chintupatel2672
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 6

#include <stdio.

h>

void main()
{
int i,j=0,x=-1,k[10],m=0,n,t,s=0,d=0,c,e[10],f[10];
int a[50],temp,b[50],p[10],bur[10],bur1[10],min,max;
int wtime[10],ttime[10],ctime[10],atime[10],put,tottime,towtime;
float attime,awtime,thpt;

printf("Enter no. of process : ");


scanf("%d", &n);
for(i=0; i<n; i++)
{
printf("Burst time for process P%d : ", (i+1));
scanf("%d", &bur[i]);
bur1[i] = bur[i];
}
for(i=0; i<n; i++)
{

printf("Arrival time for process P%d : ", (i+1));


scanf("%d", &atime[i]);
//atime[i] = atime[i];
}
min = bur[0];
for (i = 0; i < n; i++)
{
if (bur[i] < min)
min = bur[i];
}
max = bur[0];
for (i = 0; i < n; i++)
{
if (bur[i] > max)
max = bur[i];
}
printf("Enter the time slice (in ms) b/w %d and %d : ",min,max);
scanf("%d", &t);
for(i=0; i<n; i++)
{
b[i] = bur[i]/t;
c = bur[i] % t;
f[i] = t - c;
d = d + f[i];
if((bur[i]%t)!= 0)
b[i]+=1;
m += b[i];
e[i] = b[i];
}

printf("\n\t\tRound Robin Scheduling\n");

printf("\nNo. of cycles: %d",m);


printf("\nTime Wastage : %d ms",d);
printf("\n\n\nGantt Chart\n");
for(i=0; i<m; i++)
printf("----------");
printf("\n");
a[0] = 0;
while(j < m)
{
if(x == n-1)
x = 0;
else
x++;
if(bur[x] >= t)
{
bur[x] -= t;
a[j+1] = a[j] + t;

if(b[x] == 1)
{
p[s] = x;
k[s] = a[j+1];
s++;
}
j++;
b[x] -= 1;
printf(" P%d |", x+1);
}
else if(bur[x] != 0)
{
a[j+1] = a[j] + bur[x];
bur[x] = 0;
if(b[x] == 1)
{
p[s] = x;
k[s] = a[j+1];
s++;
}
j++;
b[x] = 1;
printf(" P%d |",x+1);
}
}

printf("\n");

for(i=0; i<m; i++)


printf("----------");
printf("\n");
printf("0");

for(j=1; j<=3; j++)


{
printf(" %1.i", a[j]);
}
for(j=4; j<=5; j++)
{
printf(" %2.i", a[j]);
}
for(j=6; j<=m; j++)
{
printf(" %3.i", a[j]);
}
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
if(p[i] > p[j])
{
if((atime[i] < atime[j]) || (atime[i] == atime[j]&& p[i] < p[j]))
{
temp = p[i];
p[i] = p[j];
p[j] = temp;

temp = atime[i];
atime[i] = atime[j];
atime[j] = temp;

temp = k[i];
k[i] =k[j];
k[j] = temp;

temp = e[i];
e[i] = e[j];
e[j] = temp;

temp = f[i];
f[i] = f[j];
f[j] = temp;
}
}
}
}
for(i=0; i<n +1; i++)
{
ttime[-1]=0;
wtime[-1]=0;
wtime[i] = k[i] - bur1[i];
ctime[i] = k[i] ;
ttime[i] = ctime[i] - atime[i];
attime = attime + ttime[i];
awtime = awtime + wtime[i];
t= ctime[n-1];
}
tottime = towtime =0;

for(i=0; i<n+1; i++)


{
tottime += ttime[i-1];
towtime += wtime[i-1];
}

printf("\n\n Process Table\n");


for(i=0; i<85; i++)
printf("-");
printf("\n");
printf("| Time | Process | No.of | Wastage | Turnaround Time |
Waiting Time | \n");
printf("| | Completed | Cycle's | Second in ms | =(P.C-P.S) |
=(T.T-B.T) | \n");
for(i=0; i<85; i++)
printf("-");
printf("\n");
printf("| 0 | - | - | - | - |
- |", ctime[i]);
for (i=0; i<n; i++)
printf("\n| %3d | P%-2d | %2d | %2d |%9d |%8d
|",ctime[i],p[i]+1,e[i],f[i],ttime[i],wtime[i]);

printf("\n");
for(i=0; i<85; i++)
printf("-");
printf("\n");
printf("| - | - | %3d | %3d | - |
- |",m,d);
printf("\n");
for(i=0; i<85; i++)
printf("-");
printf("\n\nAverage turn around time = Total Turn Around Time / No. of processes \
n=(");
for(i=1;i<n;i++){
printf("TT (P%d)+ ",i);
}
printf("TT (P%d))/%d \n= (",n,n);
for(i=0;i<(n-1);i++){
printf("%d+",ttime[i]);
}
attime = (float)tottime/n;
printf("%d)/%d \n= ",ttime[n-1],n);
printf("%d/%d \n=",tottime,n);
printf(" %.2f ms",attime);
printf("\nAverage waiting time = Total Waiting Time / No. of processes \n=(");
for(i=1;i<n;i++){
printf("WT (P%d) + ",i);
}
printf("WT (P%d))/%d \n= (",n,n);
for(i=0;i<(n-1);i++){
printf("%d+",wtime[i]);
}
awtime = (float)towtime/n;
printf("%d)/%d \n= ",wtime[n-1],n);

printf("%d/%d \n=",towtime,n);
printf(" %.2f ms",awtime);
printf("\nThroughtput = (No. of Process Completed / Total Time) \n= %d / %d \n=
%5.2f ms\n\n",n,t,(float)n/(float)t);

put = ( ctime[i-1] / (ctime[i-1] + 0))*100;


printf("Processor Utilisation \n= (Processor Busy Time / (Processor Busy Time +
Processor Ideal Time))*100 \n= ");
printf("(%d /",t,(float)t);
printf("(%d + 0))*100\n",t,(float)t);
printf("= (1/1)*100\n");
printf("= %d",put);
printf("%%");

}
output

Enter no. of process : 8


Burst time for process P1 : 9
Burst time for process P2 : 18
Burst time for process P3 : 26
Burst time for process P4 : 39
Burst time for process P5 : 45
Burst time for process P6 : 20
Burst time for process P7 : 33
Burst time for process P8 : 55
Arrival time for process P1 : 2
Arrival time for process P2 : 5
Arrival time for process P3 : 1
Arrival time for process P4 : 6
Arrival time for process P5 : 4
Arrival time for process P6 : 2
Arrival time for process P7 : 3
Arrival time for process P8 : 4
Enter the time slice (in ms) between 9 and 55 : 20

Round Robin Scheduling

No. of cycles: 15
Time Wastage : 75 ms

Gantt Chart
-----------------------------------------------------------------------------------
-------------------------------------------------------------------
| P1 | P2 | P3 | P4 | P5 | P6 | P7 | P8 |
P3 | P4 | P5 | P7 | P8 | P5 | P8 |
-----------------------------------------------------------------------------------
-------------------------------------------------------------------
0 9 27 47 67 87 107 127 147
153 172 192 205 225 230 245

Process Table
-----------------------------------------------------------------------------------
--
| Time | Process | No.of | Wastage | Turnaround Time | Waiting Time
|
| | Completed | Cycle's | Second in ms | =(P.C-P.S) | =(T.T-B.T)
|
-----------------------------------------------------------------------------------
--
| 0 | - | - | - | - | -
|
| 9 | P1 | 1 | 11 | 7 | 0
|
| 27 | P2 | 1 | 2 | 22 | 9
|
| 153 | P3 | 2 | 1 | 147 | 127
|
| 172 | P4 | 3 | 15 | 168 | 133
|
| 230 | P5 | 2 | 7 | 227 | 185
|
| 205 | P7 | 1 | 20 | 203 | 185
|
| 107 | P6 | 2 | 14 | 106 | 74
|
| 245 | P8 | 3 | 5 | 241 | 190
|
-----------------------------------------------------------------------------------
--

Average turn around time = Total Turn Around Time / No. of processes
=(TT (P1)+ TT (P2)+ TT (P3)+ TT (P4)+ TT (P5)+ TT (P6)+ TT (P7)+ TT (P8))/8
= (7+22+147+168+227+203+106+241)/8
= 1121/8
= 140.12 ms

Average waiting time = Total Waiting Time / No. of processes


=(WT (P1) + WT (P2) + WT (P3) + WT (P4) + WT (P5) + WT (P6) + WT (P7) + WT (P8))/8
= (0+9+127+133+185+185+74+190)/8
= 903/8
= 112.88 ms

Throughtput = (No. of Process Completed / Total Time)


= 8 / 245
= 0.03 ms

Processor Utilisation
= (Processor Busy Time / (Processor Busy Time + Processor Ideal Time))*100
= (245 /(245 + 0))*100
= (1/1)*100
= 100%

You might also like