Simulator for CPU Scheduling Algorithms

CPU scheduling is a process that allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU.
It is a basic simulator that taked input from user and simulate CPU scheduling algorithms using gantt chart

Algorithms simulated

1. First Come First serve : Process that arrive first get CPU first
2. Shortest Job First without Preemption: Process with shortest CPU time get CPU first.
3. Shortest Job First with Preemption: Process with shortest remaining CPU time get CPU first.
4. Round Robin: All processes get CPU for some fixed time.

Implementation Details

• Data structures implemented in javaScript
  • Min Heap/Priority Queue
  • Queue
• About.html contains developers page
• Algo.html contains template for each algorithm
• js/draw.js draws gantt chart for each algorithm