OS/PrioritySch.cpp at master · aniketshahi/OS · 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
// #include <iomanip>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// using namespace std;

// struct Process
// {
//     int id;
//     int arrival_time;
//     int burst_time;
//     int priority;
//     int completion_time;
//     int turnaround_time;
//     int waiting_time;
// };

// bool compareArrivalTime(const Process &a, const Process &b)
// {
//     return a.arrival_time < b.arrival_time;
// }

// bool comparePriority(const Process &a, const Process &b)
// {
//     return a.priority < b.priority;
// }

// int main()
// {
//     int n;
//     cout << "Enter the number of processes: ";
//     cin >> n;

//     vector<Process> processes(n);
//     for (int i = 0; i < n; ++i)
//     {
//         processes[i].id = i + 1;
//         cout << "Enter arrival time, burst time, and priority for process " << i + 1 << ": ";
//         cin >> processes[i].arrival_time >> processes[i].burst_time >> processes[i].priority;
//     }

//     sort(processes.begin(), processes.end(), compareArrivalTime);
//     int current_time = processes[0].arrival_time;

//     int total_turnaround_time = 0;
//     int total_waiting_time = 0;
//     int total_burst_time = 0;

//     cout << left << setw(5) << "P#" << setw(15) << "Arrival Time" << setw(15)
//          << "Burst Time" << setw(15) << "Priority" << setw(15) << "Completion Time"
//          << setw(15) << "Turnaround Time"
//          << "Waiting Time" << endl;

//     while (!processes.empty())
//     {
//         vector<Process> ready_queue;
//         for (const auto &p : processes)
//         {
//             if (p.arrival_time <= current_time)
//             {
//                 ready_queue.push_back(p);
//             }
//             else
//             {
//                 break;
//             }
//         }

//         if (!ready_queue.empty())
//         {
//             sort(ready_queue.begin(), ready_queue.end(), comparePriority);
//             Process &selected_process = ready_queue.front();
//             selected_process.completion_time = current_time + selected_process.burst_time;
//             selected_process.turnaround_time = selected_process.completion_time - selected_process.arrival_time;
//             selected_process.waiting_time = selected_process.turnaround_time - selected_process.burst_time;
//             current_time = selected_process.completion_time;

//             total_turnaround_time += selected_process.turnaround_time;
//             total_waiting_time += selected_process.waiting_time;
//             total_burst_time += selected_process.burst_time;

//             processes.erase(remove_if(processes.begin(), processes.end(),
//                                       [&](const Process &p)
//                                       { return p.id == selected_process.id; }),
//                             processes.end());
//             cout << "P" << left << setw(4) << selected_process.id << setw(15)
//                  << selected_process.arrival_time << setw(15) << selected_process.burst_time << setw(15)
//                  << selected_process.priority << setw(15) << selected_process.completion_time
//                  << setw(15) << selected_process.turnaround_time << selected_process.waiting_time
//                  << endl;
//         }
//         else
//         {
//             current_time++;
//         }
//     }

//     double cpu_utilization = (static_cast<double>(total_burst_time) / current_time) * 100.0;
//     double throughput = static_cast<double>(n) / total_turnaround_time;

//     cout << "CPU Utilization: " << cpu_utilization << "%" << endl;
//     cout << "Throughput: " << throughput << " processes/unit time" << endl;
//     return 0;
// }