This document discusses CPU scheduling algorithms including FCFS, SRT, and Round Robin. It describes building a simulator to evaluate the performance of these algorithms based on metrics like average turnaround time, waiting time, and number of context switches. The document implemented each algorithm separately and calculated performance results. It concluded by displaying summaries of the results, including average CPU burst times, waiting times, turnaround times, and number of context switches for each scheduling type.

1. CSCI 3453 Operating System Concepts
Answer:
Introduction
The assignment is based on understanding various CPU scheduling algorithms to know
about building a simulator for CPU scheduling algorithms and evaluating their
performances. Here, the FCFS (First Come First Serve), SRT (Shortest Remaining Time) and
Round Robin Scheduling (RR) are the types of CPU scheduling that have been used
(Zouaoui, Boussaid and Mtibaa 2019).
Discussion
CPU scheduling is used to ensure that the operation system executes a process from the
ready queue upon being idle (Harki, Ahmed and Haji 2020). Here, the selection process is
carried out by the CPU scheduler. In this assignment, we have used FCFS (First Come First
Serve), SRT (Shortest Remaining Time) and Round Robin Scheduling (RR) CPU scheduling
algorithms to evaluate the performance based on the measurement such as average
turnaround time, average waiting time, and the total number of contexts switching. In the
main file, we have created all the methods related to it: FCFS, SRTF, RR, inputFile, Sort,
addWaitTime, addTurnaroundTIme, and removeProcess. We have implemented all the CPU
scheduling types separately and calculated the performance based on the measurement.
Conclusion
Thus, we have implemented FCFS (First Come First Serve), SRT (Shortest Remaining Time)
and Round Robin Scheduling (RR) to evaluate the performance. The program collects the
time of completion, waiting time, turnaround time and the number of contexts switching for
each type of CPU scheduling. And the summary of the result is displayed as average CPU
burst time, average waiting time, average turnaround time, average response time and the
total number of contexts switching performed.
References
Harki, N., Ahmed, A. and Haji, L., 2020. CPU scheduling techniques: A review on novel

2. approaches strategy and performance assessment. Journal of Applied Science and
Technology Trends, 1(2), pp.48-55.
Zouaoui, S., Boussaid, L. and Mtibaa, A., 2019. Priority based round robin (PBRR) CPU
scheduling algorithm. International Journal of Electrical & Computer Engineering (2088-
8708), 9(1).