OS-Project/Project.c at master · riyalj10/OS-Project · GitHub

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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include<stdio.h>
struct process
{
	int arrival;
	int burst;
	int f_time;
	int wait;
	int cpu;
	float pr;
}p[20];
int time_unit=0;
int np,i,npl=0;
int d=0;

void showcase()
{	printf("\n Process number\t     arrival time\t    burst time");
	for(i=0;i<np;i++)
	{
		printf("\n\t   %d \t       %d\t\t       %d",i+1,p[i].arrival,p[i].burst);
	}
}
void testcase()
{	np=4;
	p[0].arrival=0;  p[0].burst=20; p[0].pr=1;
	p[1].arrival=5;  p[1].burst=36; p[1].pr=1;
	p[2].arrival=13; p[2].burst=19; p[2].pr=1;
	p[3].arrival=17; p[3].burst=42; p[3].pr=1;
	printf("\n Test case is=> ");
	showcase();
}

int max_priority()
{
	float max=-1;
	int maxp=0;
	for(i=0;i<np;i++)
	{
		if(p[i].arrival>=0 && p[i].arrival<=time_unit && p[i].burst>0)
			{
			if(max<p[i].pr)
			{max=p[i].pr;
			maxp=i;
			}
			}
	}
	return maxp;
}

void processing(int n)
{
	printf("\n\t\t time unit \t\t Process number");
	printf("\n\t\t     %d  \t\t\t P%d",time_unit,n+1);
	p[n].burst--;
	p[n].cpu=1;
	if(p[n].burst==0){p[n].f_time=time_unit;}


	for(i=0;i<np;i++)
	{
	if(i!=n && p[i].arrival<time_unit && p[i].burst!=0)
	{
	p[i].wait++;
	}
	}

	for(i=0;i<np;i++)
	{if(p[i].burst!=0)
	{
	p[i].pr=(float)p[i].wait/p[i].burst;
	p[i].pr=p[i].pr+1;
	}
	else {p[i].pr=0;}
	}
}

void processing2()
{printf("\n\t\t time unit \t\t Process number");
 printf("\n\t\t     %d  ",time_unit);}

int main()
{	int gp,flag,temp,j;
	float temp1=0,temp2=0;
	int avgw=0,avgtat=0,tat;
	printf("\n\n\t\t\t\t\t\t\t OS Project \n");
	testcase();
	printf("\n\n Execution starting: \n");
	do
	{
	flag=0;
	for(i=0;i<np;i++)
	{
	if(p[i].burst!=0)
	flag=1;
	}

		if(flag==1)
		{ 	gp=max_priority();
			temp=p[gp].burst;
			if(temp==0)goto E;
			else{

			for(j=0;j<temp;j++)
			{E:
			time_unit++;
			if(p[gp].burst>0)
				{processing(gp);}
		else
		{
			p[gp].pr=0;
			processing2();
	   	 }}}

		}
	}while(flag==1);

		printf("\n\n Total time units taken: %d",time_unit);

		for(i=0;i<np;i++)
		{ tat=0;
		if(p[i].cpu==1)
			{
		    	tat=p[i].f_time-p[i].arrival;
				avgw=avgw+p[i].wait;
				avgtat=avgtat+tat;
				npl++;
			}
			printf("\n");
		  }
		if(npl>0)
		{
			temp1=(float)avgw/npl;
			temp2=(float)avgtat/npl;
		}
		printf("\n\n Average waiting time= %d/%d = %.2f",avgw,npl,temp1);
		printf("\n Average turn around time= %d/%d = %.2f",avgtat,npl,temp2);


return 0;
}