CPU Scheduling Algorithms Visualizer

An interactive web-based application that visualizes various CPU Scheduling Algorithms used in Operating Systems. This project helps students and developers understand how different scheduling techniques work by providing step-by-step execution and graphical visualization.

The visualizer allows users to input process details such as arrival time, burst time, and priority, and then observe how the CPU schedules processes based on different algorithms. It dynamically calculates waiting time, turnaround time, and displays execution order to make learning OS concepts easier and more intuitive.

Live Demo: https://atingupta708.github.io/CPU-Scheduling-Algorithms-Visualizer/

Features

• Visualization of major CPU scheduling algorithms
• Step-by-step execution of processes
• Interactive user input for process parameters
• Automatic calculation of:
  • Waiting Time
  • Turnaround Time
• Clean and user-friendly UI
• Real-time scheduling simulation

Algorithms Implemented

• First Come First Serve (FCFS)
• Shortest Job First (SJF)
• Shortest Remaining Time First (SRTF)
• Priority Scheduling
• Round Robin Scheduling

Technologies Used

• HTML – Structure of the application
• CSS – Styling and UI design
• JavaScript – Algorithm logic and visualization

How to Run

1. Clone the repository
2. Open the project folder
3. Run index.html in your browser