-
Notifications
You must be signed in to change notification settings - Fork 0
/
MultilevelQueueScheduling.c
115 lines (93 loc) · 2.63 KB
/
MultilevelQueueScheduling.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include<stdio.h>
int main()
{
int i, limit, total = 0, x, counter = 0, time_quantum,j;
int wait_time = 0, turnaround_time = 0,pos,z,p[10],prio[10], a_time[10], b_time[10], temp[10],b;
float average_wait_time, average_turnaround_time;
printf("\nEnter Total Number of Processes:");
scanf("%d", &limit);
x = limit;
for(i = 0; i < limit; i++)
{
p[i]=i+1;
prio[i]=0;
printf("\nEnter total Details of Process[%d]\n", i + 1);
printf("Arrival Time:\t");
scanf("%d", &a_time[i]);
printf("Burst Time:\t");
scanf("%d", &b_time[i]);
temp[i] = b_time[i];
}
printf("\nEnter the Time Quantum:");
scanf("%d", &time_quantum);
printf("\nProcess ID\t\tBurst Time\t Turnaround Time\t Waiting Time\t Priority\n");
for(total = 0, i = 0; x != 0;)
{
for(z=0;z<limit;z++)
{
int temp1;
pos=z;
for(j=z+1;j<limit;j++)
{
if(prio[j]<prio[pos])
pos=j;
}
temp1=prio[z];
prio[z]=prio[pos];
prio[pos]=temp1;
temp1=b_time[z];
b_time[z]=b_time[pos];
b_time[pos]=temp1;
temp1=a_time[z];
a_time[z]=a_time[pos];
a_time[pos]=temp1;
temp1=p[z];
p[z]=p[pos];
p[pos]=temp1;
temp1=temp[z];
temp[z]=temp[pos];
temp[pos]=temp1;
}
{
}
if(temp[i] <= time_quantum && temp[i] > 0)
{
total = total + temp[i];
temp[i] = 0;
counter = 1;
}
else if(temp[i] > 0)
{
temp[i] = temp[i] - time_quantum;
total = total + time_quantum;
}
for(b=0;b<limit;b++)
{
if(b==i)
prio[b]+=1;
else
prio[b]+=2;
}
if(temp[i] == 0 && counter == 1)
{
x--;
printf("\nProcess[%d]\t\t%d\t\t %d\t\t %d\t\t%d", p[i], b_time[i], total - a_time[i], total - a_time[i] - b_time[i],prio[i]);
wait_time = wait_time + total - a_time[i] - b_time[i];
turnaround_time = turnaround_time + total - a_time[i];
counter = 0;
}
if(i == limit - 1)
{
i = 0;
}
else if(a_time[i + 1] <= total)
{
i++;
}
else
{
i = 0;
}
}
return 0;
}