A C-based Process Scheduling Simulator that allows you to visualize and compare how different CPU scheduling algorithms work in real-time.
It generates Gantt charts and displays key statistics such as Turnaround Time, Waiting Time, and Throughput.
-
Multiple Scheduling Algorithms
- First-Come, First-Served (FCFS)
- Shortest Job First (SJF) (Coming Soon)
- Priority Scheduling (Coming Soon)
- Round Robin (RR) (Coming Soon)
-
📊 Gantt Chart Visualization – Shows the process execution timeline clearly.
-
📈 Detailed Metrics – Turnaround Time, Waiting Time, and Throughput.
-
📝 Interactive Input – Enter process details like Burst Time, Arrival Time, and Priority.
| Algorithm | Description |
|---|---|
| FCFS | Processes are executed in the order they arrive. |
| SJF (WIP) | Executes the process with the shortest burst time first. |
| Priority (WIP) | Executes based on process priority (higher priority first). |
| Round Robin (WIP) | Each process gets a fixed time slice and cycles through a queue. |
git clone https://github.com/PraTeekK123/Process_scheduling_algo1.git
cd Process_scheduling_algo1