📊 Gantt Chart
Run a simulation to see the Gantt chart
⚖️ Algorithm Comparison
🏗️ OOP Class Design
OOP Principles Applied
schedule() method is overridden in each subclass. A single Scheduler reference can run any algorithm at runtime.schedule() and getMetrics().AI-Powered CPU Scheduling Simulator
An interactive educational tool demonstrating core OS scheduling concepts through object-oriented design principles and intelligent algorithm analysis.
AI Recommendation Engine
The AIAdvisor class analyzes workload characteristics — burst time variance, arrival patterns, priority distribution — to recommend the optimal scheduling algorithm.
OOP Architecture
Built with clean OOP principles: an abstract Scheduler base class with 5 concrete algorithm subclasses, a Process entity class, Metrics value object, and AI Advisor.
Visual Gantt Chart
Animated Gantt chart visualization with process color coding, time axis, and step-by-step animation mode showing CPU execution timeline.
Algorithm Comparison
Run all 6 scheduling algorithms on the same process set simultaneously and compare performance metrics side by side with bar charts and rankings.
First Come First Served
Processes are executed in the order they arrive. Simple but can suffer from the convoy effect.
Shortest Job First
Selects the process with smallest burst time. Optimal for average waiting time among non-preemptive algorithms.
Shortest Remaining Time First
Preemptive version of SJF. CPU is given to process with least remaining time. Theoretically optimal.
Round Robin
Each process gets a time quantum. Fair and provides good response time. Widely used in time-sharing systems.
Priority (Non-Preemptive)
Processes are scheduled based on priority. Higher priority processes run first. Can cause starvation.
Priority (Preemptive)
Running process can be preempted by a newly arrived higher-priority process. Dynamic prioritization.