Multiprocessor-scheduling-algorithms/Project.cpp at main · M-aboelsafa/Multiprocessor-scheduling-algorithms · 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
#include "scheduler.h"

using namespace std;

// priority_queue<process,compare>

void Input(int n, process processes[])
{
    string y;
    int x;
    for (int i = 0; i < n; i++)
    {
        cin >> processes[i].process_name;
        cin >> processes[i].n_phases;
        cin >> processes[i].arrive_time;
        processes[i].phases.resize(processes[i].n_phases);
        for (int j = 0; j < processes[i].n_phases; j++)
        {
            cin >> processes[i].phases[j].first;
            cin >> y;
            if (y == "I/O")
            {
                processes[i].phases[j].second = 0;
            }
            if (y == "EXE")
            {
                processes[i].phases[j].second = 1;
            }
        }
        processes[i].last_processor = -1;
        processes[i].phase_idx = 0;
        processes[i].time_consumed = 0;
        processes[i].process_idx = i;
        processes[i].state = 1;
        processes[i].qunta = 0;
        processes[i].tickets = calculateTickets(processes[i]);
        processes[i].pass_value = 0;
        processes[i].time_consumed = 0;
        processes[i].stride = MAX_STRIDE / processes[i].tickets;
        // processes[i].current_brust_time = processes[i].phases[0].first;
    }
}
void Input_Priority(int n, process processes[])
{
    string y;
    int x;
    for (int i = 0; i < n; i++)
    {
        cin >> processes[i].process_name;
        cin >> processes[i].n_phases;
        cin >> processes[i].arrive_time;
        cin >> processes[i].priority;
        processes[i].phases.resize(processes[i].n_phases);
        for (int j = 0; j < processes[i].n_phases; j++)
        {
            cin >> processes[i].phases[j].first;
            cin >> y;
            if (y == "I/O")
            {
                processes[i].phases[j].second = 0;
            }
            if (y == "EXE")
            {
                processes[i].phases[j].second = 1;
            }
        }
        processes[i].last_processor = -1;
        processes[i].phase_idx = 0;
        processes[i].time_consumed = 0;
        processes[i].process_idx = i;
        processes[i].state = 1;
        processes[i].qunta = 0;
        // processes[i].current_brust_time = processes[i].phases[0].first;
    }
}

void choose_scheduler(int n, string scheduler, process processes[])
{
    if (scheduler == "RR")
    {
        round_robin(n, processes);
    }
    if (scheduler == "MLFQ")
    {
        MLFQ(n, processes);
    }
    if (scheduler == "SJF")
    {
        SJF(n, processes);
    }
    if (scheduler == "STCF")
    {
        STCF(n, processes);
    }
    if (scheduler == "FCFS")
    {
        FCFS(n, processes);
    }
    if (scheduler == "Priority")
    {
        Priority(n, processes);
    }
    if (scheduler == "Stride")
    {
        strideScheduler(n, processes);
    }
}
int main()
{

    freopen("input.txt", "r", stdin);

    string scheduler;
    cin >> scheduler;
    int n;
    cin >> n;
    process processes[n];
    if (scheduler == "Priority")
        Input_Priority(n, processes);
    else
        Input(n, processes);
    choose_scheduler(n, scheduler, processes);
}