Processor Scheduling Algorithms using a Discrete-Event Simulator
Jeyaprakash Chelladurai · 2023
In this paper, we present a framework for implementing the popular round robin scheduling algorithm, which is widely used in operating systems due to its simplicity and fairness among processes. Despite its widespread use, operating system textbooks often only discuss the concept of round robin scheduling and not its implementation. Our framework uses discrete-event simulation to not only implement the algorithm but also test and manipulate different scheduling algorithms to potentially discover faster ways of scheduling processes before deployment into operating systems. It is important to note that scheduling algorithms are essential for operating systems, and efficient algorithms can lead to faster process times without the need for better processors.