Newer
Older
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SIZE 5
struct process{
int process_id;
int arrival_time;
int execution_time;
int start_time;
};
void init_processes(struct process *);
void display(struct process *);
void display_average_waiting_time(struct process *);
void schedule_FCFS(struct process *);
int main()
{
struct process processes[SIZE];
init_processes(processes);
printf("Orignial input (processes)\n");
display(processes);
schedule_FCFS(processes);
printf("Execution according to FCFS policy\n");
display(processes);
display_average_waiting_time(processes);
}
void init_processes(struct process * input)
{
srand(100);
for(int i=0;i<SIZE;i++)
{
input[i].arrival_time = rand()%10;
input[i].execution_time = rand()%10;
input[i].process_id= i;
input[i].start_time=-1;
}
}
void display(struct process * input){
printf("process<id, arr, exe, start>:");
for(int i=0;i<SIZE;i++)
{
printf("<%d,%d,%d,%d> ", input[i].process_id,
input[i].arrival_time, input[i].execution_time, input[i].start_time);
}
printf("\n");
}
void schedule_FCFS(struct process * arr)
{
//TODO
printf("Not implemented Yet!\n");
}
void schedule_SJF(struct process * arr)
{
//TODO
printf("Not implemented Yet!\n");
}
void schedule_LJF(struct process * arr)
{
//TODO
printf("Not implemented Yet!\n");
}
void display_average_waiting_time(struct process * arr)
{
//TODO
printf("Not implemented Yet!\n");
}