backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-08 06:43:14 +08:00
Code Issues Projects Releases Wiki Activity

Update non_preemptive_sjf_scheduling.cpp

Browse Source
This commit is contained in:
LakshmiSrikumar
2024-10-13 17:17:57 +05:30
parent 16d952f6fe
commit 6ebca75a66
1 changed files with 23 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
cpu_scheduling_algorithms/non_preemptive_sjf_scheduling.cpp
View File

@@ -135,24 +135,21 @@ class SJF {
}
/**
* @brief Algorithm for scheduling CPU processes according to the Shortest Job
First (SJF) scheduling algorithm.
*
* @details Non pre-emptive SJF is an algorithm that schedules processes based
on the length
* of their burst times. The process with the smallest burst time is executed
first.
* In a non-preemptive scheduling algorithm, once a process starts executing,
* it runs to completion without being interrupted.
*
* I used a min priority queue because it allows you to efficiently pick the
process
* with the smallest burst time in constant time, by maintaining a priority
order where
* the shortest burst process is always at the front.
*
* @returns void
*/
* @brief Algorithm for scheduling CPU processes according to
* the Shortest Job First (SJF) scheduling algorithm.
*
* @details Non pre-emptive SJF is an algorithm that schedules processes
* based on the length of their burst times. The process with the smallest
* burst time is executed first.In a non-preemptive scheduling algorithm,
* once a process starts executing,it runs to completion without being
* interrupted.
*
* I used a min priority queue because it allows you to efficiently pick the
* process with the smallest burst time in constant time, by maintaining a
* priority order where the shortest burst process is always at the front.
*
* @returns void
*/
vector<tuple<S, T, E, double, double, double>> scheduleForSJF() {
// Variable to keep track of time elapsed so far
@@ -192,8 +189,8 @@ class SJF {
return result;
}
/**
* @brief Utility function for printing the status of each process after
* execution
* @brief Utility function for printing the status of
* each process after execution
* @returns void
*/
@@ -217,8 +214,8 @@ class SJF {
};
/**
* @brief Computes the final status of processes after applying non-preemptive
* SJF scheduling
* @brief Computes the final status of processes after
* applying non-preemptive SJF scheduling
* @tparam S Data type of Process ID
* @tparam T Data type of Arrival time
* @tparam E Data type of Burst time
@@ -290,8 +287,8 @@ static void test() {
}
// Print processes before scheduling
// cout << "Processes before SJF scheduling:" << endl;
// readyQueue.printResult(input);
cout << "Processes before SJF scheduling:" << endl;
readyQueue.printResult(input);
// Add processes to the queue
for (uint32_t i{}; i < n; i++) {
@@ -303,8 +300,8 @@ static void test() {
auto finalResult = readyQueue.scheduleForSJF();
// Print processes after scheduling
// cout << "\nProcesses after SJF scheduling:" << endl;
// readyQueue.printResult(finalResult);
cout << "\nProcesses after SJF scheduling:" << endl;
readyQueue.printResult(finalResult);
}
cout << "All the tests have successfully passed!" << endl;
}