CPU Scheduling Algorithms
Visualize and compare different CPU scheduling algorithms. Input processes and see step-by-step execution with Gantt charts.
Select Algorithm
Process Table
| Process ID | Arrival Time | Burst Time | Action |
|---|---|---|---|
First Come First Serve (FCFS)
Non-preemptive scheduling based on arrival time
Advantages:
- ✓Simple implementation
- ✓No starvation
- ✓Fair in arrival order
Disadvantages:
- ✗High average waiting time
- ✗Convoy effect
- ✗Not suitable for time-sharing
University Exam Tips
- • Always draw the Gantt chart
- • Calculate waiting time = turnaround time - burst time
- • Show all calculation steps
- • Compare algorithms in conclusion