Round Robin CPU Scheduling

This project is a command line tool that was created to simulate the Round Robin CPU scheduling algorithm that may be used by a computer’s operating system.

The generated output can be analyzed to show how different time quantums may affect the overall performance of an operating system that uses Round Robin scheduling.

When using a multitasking operating system, many processes must compete for execution by the computer’s CPU. A scheduling algorithm is used to determine the order in which processes are executed, and for how long. The scheduling algorithm impacts the overall performance of the system.

The goals of CPU scheduling are to maximize CPU utilization, maximize throughput, minimize turnaround time, minimize waiting time, and minimize response time.

Round Robin is a scheduling algorithm that divides CPU execution time equally among all processes that are ready to be executed. The algorithm uses a specified time quantum, which indicates the amount of time each process gets to spend executing on the CPU. Each process executes in the order that it arrives in the ready queue. If one CPU cycle is not enough, it is inserted at the end of the queue and waits until it can be executed again. This cycle continues for all processes until they are complete.