OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

clang-format and clang-tidy fixes for 295f0cc6

Browse Source
This commit is contained in:
github-actions 2021-10-12 06:26:56 +00:00
parent 295f0cc6d1
commit 07afee4b94
1 changed files with 84 additions and 73 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

121
cpu_scheduling_algorithms/fcfs_scheduling.cpp
View File

@ -2,17 +2,18 @@
* @file fcfs_scheduling.cpp
* @brief Implementation of FCFS CPU scheduling algorithm
* @details
* FCFS is a non-preemptive CPU scheduling algorithm in which whichever process arrives first, gets executed first.
* If two or more processes arrive simultaneously, the process with smaller process ID gets executed first.
* FCFS is a non-preemptive CPU scheduling algorithm in which whichever process
* arrives first, gets executed first. If two or more processes arrive
* simultaneously, the process with smaller process ID gets executed first.
* @link https://bit.ly/3ABNXOC
* @author Pratyush Vatsa(https://github.com/Pratyush219)
*/
*/
#include <iostream> // for IO operations
#include <vector> // for using vector
#include <unordered_set> // for using unordered_set
#include <queue> // for priority_queue
#include <iomanip> // for formatting the output
#include <iostream> // for IO operations
#include <queue> // for priority_queue
#include <unordered_set> // for using unordered_set
#include <vector> // for using vector
using std::cin;
using std::cout;
@ -31,24 +32,28 @@ using std::vector;
* @tparam S: Data type of Process ID
* @tparam T: Data type of Arrival time
* @tparam E: Data type of Burst time
*/
template<typename S, typename T, typename E>
class Compare{
*/
template <typename S, typename T, typename E>
class Compare {
public:
/**
* @param t1: first tuple
* @param t2: second tuple
* @brief A comparator function that checks whether to swap the two tuples or not.
* @link Refer https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for detailed description of comparator
* @brief A comparator function that checks whether to swap the two tuples
* or not.
* @link Refer
* https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/ for
* detailed description of comparator
* @returns true if the tuples should be swapped, false othewise
*/
bool operator () (tuple<S, T, E, double, double, double>& t1, tuple<S, T, E, double, double, double>& t2){
bool operator()(tuple<S, T, E, double, double, double>& t1,
tuple<S, T, E, double, double, double>& t2) {
// Compare arrival times
if(get<1>(t2) < get<1>(t1)){
if (get<1>(t2) < get<1>(t1)) {
return true;
}
// If arrival times are same, then compare Process IDs
else if(get<1>(t2) == get<1>(t1)){
else if (get<1>(t2) == get<1>(t1)) {
return get<0>(t2) < get<0>(t1);
}
return false;
@ -61,9 +66,9 @@ class Compare{
* @tparam S: Data type of Process ID
* @tparam T: Data type of Arrival time
* @tparam E: Data type of Burst time
*/
template<typename S, typename T, typename E>
class FCFS{
*/
template <typename S, typename T, typename E>
class FCFS {
/**
* Priority queue of schedules(stored as tuples) of processes.
* In each tuple
@ -82,7 +87,8 @@ class FCFS{
// Stores final status of all the processes after completing the execution.
vector<tuple<S, T, E, double, double, double>> result;
// Stores process IDs. Used for confirming absence of a process while adding it.
// Stores process IDs. Used for confirming absence of a process while adding
// it.
unordered_set<S> idList;
public:
@ -94,27 +100,32 @@ class FCFS{
* @returns void
*
*/
void addProcess(S id, T arrival, E burst){
void addProcess(S id, T arrival, E burst) {
// Add if a process with process ID as id is not found in idList.
if(idList.find(id) == idList.end()) {
tuple<S, T, E, double, double, double> t = make_tuple(id, arrival, burst, 0, 0, 0);
if (idList.find(id) == idList.end()) {
tuple<S, T, E, double, double, double> t =
make_tuple(id, arrival, burst, 0, 0, 0);
schedule.push(t);
idList.insert(id);
}
}
/**
* @brief Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algorithm.
* @brief Algorithm for scheduling CPU processes according to the First Come
* First Serve(FCFS) scheduling algorithm.
*
* @description FCFS is a non-preemptive algorithm in which the process which arrives first gets executed first. If two or
* more processes arrive together then the process with smaller process ID runs first (each process has a unique proces ID).
* @description FCFS is a non-preemptive algorithm in which the process
* which arrives first gets executed first. If two or more processes arrive
* together then the process with smaller process ID runs first (each
* process has a unique proces ID).
*
* I used a min priority queue of tuples to accomplish this task. The processes are ordered by their arrival times. If arrival
* times of some processes are equal, then they are ordered by their process ID.
* I used a min priority queue of tuples to accomplish this task. The
* processes are ordered by their arrival times. If arrival times of some
* processes are equal, then they are ordered by their process ID.
*
* @returns void
*/
void scheduleForFcfs(){
void scheduleForFcfs() {
// Variable to keep track of time elapsed so far
double timeElapsed = 0;
@ -130,7 +141,8 @@ class FCFS{
// Add Burst time to time elapsed
timeElapsed += get<2>(cur);
// Completion time of the current process will be same as time elapsed so far
// Completion time of the current process will be same as time
// elapsed so far
get<3>(cur) = timeElapsed;
// Turnaround time = Completion time - Arrival time
@ -146,27 +158,28 @@ class FCFS{
}
/**
* @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
*/
void printResult(){
cout << "Status of all the proceses post completion is as follows:" << endl;
void printResult() {
cout << "Status of all the proceses post completion is as follows:"
<< endl;
cout << std::setw(17) << left << "Process ID"
<< std::setw(17) << left << "Arrival Time"
<< std::setw(17) << left << "Burst Time"
<< std::setw(17) << left << "Completion Time"
<< std::setw(17) << left << "Turnaround Time"
<< std::setw(17) << left << "Waiting Time" << endl;
cout << std::setw(17) << left << "Process ID" << std::setw(17) << left
<< "Arrival Time" << std::setw(17) << left << "Burst Time"
<< std::setw(17) << left << "Completion Time" << std::setw(17)
<< left << "Turnaround Time" << std::setw(17) << left
<< "Waiting Time" << endl;
for(size_t i{}; i < result.size(); i++){
cout << std::setprecision(2) << std::fixed
<< std::setw(17) << left << get<0>(result[i])
<< std::setw(17) << left << get<1>(result[i])
<< std::setw(17) << left << get<2>(result[i])
<< std::setw(17) << left << get<3>(result[i])
<< std::setw(17) << left << get<4>(result[i])
<< std::setw(17) << left << get<5>(result[i]) << endl;
for (size_t i{}; i < result.size(); i++) {
cout << std::setprecision(2) << std::fixed << std::setw(17) << left
<< get<0>(result[i]) << std::setw(17) << left
<< get<1>(result[i]) << std::setw(17) << left
<< get<2>(result[i]) << std::setw(17) << left
<< get<3>(result[i]) << std::setw(17) << left
<< get<4>(result[i]) << std::setw(17) << left
<< get<5>(result[i]) << endl;
}
}
};
@ -174,20 +187,18 @@ class FCFS{
/**
* @brief Entry point of the program
* @returns 0 on exit
*/
int main(){
FCFS<uint32_t ,uint32_t, uint32_t> readyQueue;
*/
int main() {
FCFS<uint32_t, uint32_t, uint32_t> readyQueue;
// Sample test case
int n = 3;
vector<tuple<uint32_t, uint32_t, uint32_t>> input = {
make_tuple(1, 0, 30),
make_tuple(2, 0, 5),
make_tuple(3, 0, 5)
};
make_tuple(1, 0, 30), make_tuple(2, 0, 5), make_tuple(3, 0, 5)};
for(uint32_t i{}; i < n; i++){
readyQueue.addProcess(get<0>(input[i]), get<1>(input[i]), get<2>(input[i]));
for (uint32_t i{}; i < n; i++) {
readyQueue.addProcess(get<0>(input[i]), get<1>(input[i]),
get<2>(input[i]));
}
readyQueue.scheduleForFcfs();