CPU Scheduling Algorithms Simulator
An interactive frontend simulator that visualizes and analyzes classic CPU scheduling algorithms in real-time. Built entirely with Vanilla JavaScript and Tailwind CSS, this educational tool runs directly in your browser without requiring any backend infrastructure.Quick Start
Get the simulator running in minutes
Installation
Local, Docker, or cloud deployment options
Algorithms Overview
Learn about the 5 supported scheduling algorithms
Key Features
Real-Time Visualization
Watch processes move through the CPU and ready queue with live animated displays. See the Gantt chart build step-by-step as the simulation runs.
5 Classic Algorithms
Compare FIFO, SJF, Round Robin, Priority Scheduling, and Multi-Level Feedback Queue (MLFQ) side-by-side.
Performance Metrics
Analyze waiting time, turnaround time, response time, and total execution time for each process and algorithm.
Dynamic Process Input
Configure arrival times, CPU burst times, priorities, and quantum values for custom test scenarios.
100% Frontend
No backend required - everything runs in the browser. Perfect for offline use and educational environments.
Responsive Design
Built with Tailwind CSS for a modern, responsive interface that works on any device.
Supported Algorithms
The simulator implements five fundamental CPU scheduling algorithms:- FIFO (First In, First Out) - Processes execute in arrival order
- SJF (Shortest Job First) - Shortest CPU burst executes first
- Round Robin - Time-sliced execution with configurable quantum
- Priority Scheduling - Higher priority processes execute first (non-preemptive)
- MLFQ (Multi-Level Feedback Queue) - Multiple priority queues with quantum-based demotion
All algorithms can be tested with the same input data, making it easy to compare their behavior and performance characteristics.
Educational Purpose
This simulator was designed as an academic project to help students understand:- Scheduling queues - How processes wait for CPU time
- Arrival time - When processes enter the system
- CPU burst - How long processes need the CPU
- Preemption - Interrupting running processes (Round Robin, MLFQ)
- Multi-level scheduling - Managing multiple priority queues
- Performance comparison - Evaluating algorithm efficiency
Technology Stack
Live Demo
Try the Live Demo
Experience the simulator instantly without any installation. Deployed on Render and ready to use.
The simulator requires only a modern web browser (Chrome, Edge, Firefox, or Safari). No Node.js, databases, or server infrastructure needed.
Next Steps
Get Started
Follow the Quick Start Guide to run your first simulation
Learn the Algorithms
Understand how each scheduling algorithm works
Deploy Locally
Set up the simulator on your machine with the Installation Guide