This application allows you to analyze different CPU scheduling algorithms. It currently uses 3 non preemptive algorithms (first in first out, shortest job next, non preemptive priority) and 3 preemptive algorithms (round robin, shortest time remaining, preemptive priority). I designed this application so that additional algorithms can be added in and analyzed alongside the built-in algorithms. Within the interface, you can generate random processes, create/edit your own processes, change the round robin time quantum, set all arrival times to 0, and save/load a set of processes.

Here is an early sketch I made for this application to help plan its implementation:

Early schematic for CPU scheduling program

Here is a screenshot of the working application:

CPU Scheduling Interface

The graph control used in this project is an open source C# control called ZedGraph.

This program is open source and is currently hosted on sourceforge.net at https://sourceforge.net/projects/cpuschedulingsi/.

Download here: SchedulingSimulator.zip