To properly illustrate the functionality of a CPU scheduling algorithm and the effect each algorithm has on the execution of processes, a CPU scheduling simulator was written using PHP and the results of three algorithms were collected and compared. The type of algorithm used often impacts the apparent speed at which the processes perform and complete.

In the following report, a comparison of results using the “First Come First Serve” and “Multilevel Feedback” algorithms are compared with pre-generated results of the “Shortest Job First” algorithm. We identify the strengths and weaknesses of each algorithm and discuss potential applications where each algorithm may be best suited. Additionally, we will consider the efficiency of the simulation project and discuss pitfalls of its implementation and potential areas of improvement for future iterations.

The simulation report is available here.

Or you may run this simulation locally by following this README.