-
Notifications
You must be signed in to change notification settings - Fork 0
/
deneme.c
207 lines (183 loc) · 6.18 KB
/
deneme.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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int global_time = 0;
// Define the instruction execution times
struct Instruction {
char name[10];
int exec_time;
};
// Define a process
struct Process {
char name[10];
int executionTime;
int priority;
char classType[10];
int arrivalTime;
int currentLine;
int timequantum;
};
// Comparison function for sorting processes based on priority and arrival time
int compareProcesses(const void *a, const void *b) {
const struct Process *p1 = (const struct Process *)a;
const struct Process *p2 = (const struct Process *)b;
// sort based on first arrival time then priority then name of the process
if (p1->arrivalTime < p2->arrivalTime)
{
return -1;
}
else if (p1->arrivalTime > p2->arrivalTime)
{
return 1;
}
else if (p1->priority < p2->priority)
{
return -1;
}
else if (p1->priority > p2->priority)
{
return 1;
}
else
{
return strcmp(p1->name, p2->name);
}
}
// Structure for the ready queue
struct ReadyQueue
{
struct Process processes[50];
int front;
int rear;
};
// Function to check if the ready queue is empty
int isReadyQueueEmpty(struct ReadyQueue *queue)
{
return queue->front == -1;
}
// Function to enqueue a process into the ready queue
void enqueue(struct ReadyQueue *queue, struct Process process)
{
if (queue->front == -1)
{
queue->front = 0;
}
queue->rear++;
queue->processes[queue->rear] = process;
}
// Function to dequeue a process from the ready queue
struct Process dequeue(struct ReadyQueue *queue)
{
struct Process process = queue->processes[queue->front];
if (queue->front == queue->rear)
{
queue->front = -1;
queue->rear = -1;
}
else
{
queue->front++;
}
return process;
}
int main()
{
// Read instruction times
struct Instruction instr;
// exactly 20 instructions
struct Instruction all_instr[20];
FILE *instructionFile = fopen("instructions.txt", "r");
// for each line in the file, read the instruction name and execution tim
int i = 0;
while (fscanf(instructionFile, "%s %d", instr.name, &instr.exec_time) == 2)
{
// store the instructions in an array
all_instr[i] = instr;
i++;
printf("%s %d\n", instr.name, instr.exec_time);
}
// Read processes from definition.txt and store in the ready queue
FILE *definitionFile = fopen("definition.txt", "r");
struct ReadyQueue readyQueue;
readyQueue.front = -1;
readyQueue.rear = -1;
while (fscanf(definitionFile, "%s %d %d %s", readyQueue.processes[0].name, &readyQueue.processes[0].priority, &readyQueue.processes[0].arrivalTime, readyQueue.processes[0].classType) == 4)
{
// execution time is not assigned yet
readyQueue.processes[0].currentLine = 0; // Start execution from the first line
if (strcmp(readyQueue.processes[0].classType, "SILVER") == 0)
{
readyQueue.processes[0].timequantum = 80;
}
else if (strcmp(readyQueue.processes[0].classType, "GOLD") == 0)
{
readyQueue.processes[0].timequantum = 120;
}
else if (strcmp(readyQueue.processes[0].classType, "PLATINUM") == 0)
{
readyQueue.processes[0].timequantum = 120;
}
else
{
printf("Invalid class type\n");
exit(1);
}
// Enqueue the process into the ready queue
enqueue(&readyQueue, readyQueue.processes[0]);
}
fclose(definitionFile);
// Sort the processes array based on priority and arrival time
qsort(readyQueue.processes, 1, sizeof(struct Process), compareProcesses);
printf("Sorted processes are :\n");
for (int i = readyQueue.front; i <= readyQueue.rear; i++)
{
printf("%s %d %d %s\n", readyQueue.processes[i].name, readyQueue.processes[i].priority, readyQueue.processes[i].arrivalTime, readyQueue.processes[i].classType);
}
// Scheduler
while (!isReadyQueueEmpty(&readyQueue))
{
// Dequeue the next process from the ready queue
struct Process currentProcess = dequeue(&readyQueue);
// Use processes list as a ready queue
if (!isReadyQueueEmpty(&readyQueue))
{
// Not the last process
struct Process nextProcess = readyQueue.processes[readyQueue.front];
int check_point = nextProcess.arrivalTime;
}
else
{
// Last process
printf("Last process\n");
int check_point = global_time + 10000;
}
// Open the file of the current process named currentProcess.name.txt
char filename[20];
strcpy(filename, currentProcess.name);
strcat(filename, ".txt");
FILE *processFile = fopen(filename, "r");
while (global_time < check_point)
{
// Read the next instruction from the file
char instructionName[10];
fscanf(processFile, "%s", instructionName);
// Find the instruction in the array of instructions
for (int i = 0; i < 20; i++)
{
if (strcmp(all_instr[i].name, instructionName) == 0)
{
// Execute the instruction
printf("Executing instruction %s for %d ms\n", instructionName, all_instr[i].exec_time);
global_time += all_instr[i].exec_time;
// Update the current line of the process
currentProcess.currentLine++;
// Update the execution time of the process
currentProcess.executionTime += all_instr[i].exec_time;
// Check if the process is finished
if (strcmp(instructionName, "exit") == 0)
{
// Process is finished
printf("Process %s is finished\n", currentProcess.name);
// Calculate turnaround time
int turnaroundTime = global_time - currentProcess.arrivalTime;
printf("Turnaround time for process %s is %d ms\n",