This is a Java program to simulate the following CPU Scheduling algorithms.
- First Come First Serve
- Round Robin
- Shortest Job First (Preemptive)
- Shortest Job First (Non-Preemptive)
- HRRN
- Lottery
- Earliest Deadline First
- Priority
I calculate the following values for each algorithm, generated in a .txt file with algorithm's name.
- Arrival Time
- Burst Time
- Waiting Time
- Turnaround Time
- Response Time
- Completion Time
- CPU Utilisation
- Average Waiting Time
- Average Turnaround Time
- Average Response Time
I also generate a Gaant chart using python in form of a SVG for the algorithms.
Sample data can be found in /samples
Gaant Charts
First Come First Serve
Highest Response Ratio Next
Priority
Round Robin
Shortest Job First (Non-Preemptive)
Shortest Job First (Preemptive)