Skip to main content

​
Quick Start Guide

Get started with the CPU Scheduling Algorithms Simulator in just a few steps. This guide will walk you through accessing the simulator and running your first algorithm simulation.

​
Getting Started

1

Access the Simulator

The fastest way to start is using the live demo:Visit https://planificacion-app-rcl8.onrender.com in your browser.
No installation required! The simulator runs entirely in your browser.
Alternatively, you can:
  • Open the local HTML file: AlgoritmosPlanificacion/Planificacion/index.html
  • Run with Docker: docker run -p 8080:80 algoritmos-planificacion
See the Installation Guide for detailed setup instructions.
2

Select an Algorithm

On the landing page, you’ll see five algorithm options:
  • FIFO - First In, First Out (simplest)
  • SJF - Shortest Job First
  • Round Robin - Time-sliced scheduling
  • Priority - Priority-based scheduling
  • MLFQ - Multi-Level Feedback Queue
Click any button to select your algorithm. For your first simulation, try FIFO as it’s the most straightforward.
3

Enter Process Data

After selecting an algorithm, you’ll configure the simulation:
  1. Enter the number of processes (e.g., 3)
  2. Click Continue
  3. For each process, enter:
    • Arrival Time - When the process enters the system
    • CPU Time - How long the process needs the CPU
    • Priority (Priority algorithm only) - Lower number = higher priority
    • Quantum (Round Robin/MLFQ only) - Time slice per execution
For Round Robin, enter a single quantum value (e.g., 2).For MLFQ, enter comma-separated quantum values for each priority level (e.g., 3,5,7).
4

Run the Simulation

Click the Simular button to calculate results.You’ll immediately see:
  • Process metrics (arrival, start, finish, waiting, and turnaround times)
  • Total execution time
  • Real-time simulation controls
5

View the Visualization

Control the real-time animation with these buttons:
  • ▶ Iniciar - Start the step-by-step animation
  • ⏸ Pausar - Pause the simulation
  • 🔄 Reiniciar - Reset the animation to the beginning
  • ⬅ Volver al inicio - Return to algorithm selection
Watch three visualization components update in real-time:
  1. CPU Box - Shows which process is currently executing
  2. Ready Queue - Displays processes waiting for CPU time
  3. Gantt Chart Timeline - Builds the execution timeline block by block

​
Example Simulation

Let’s run a complete FIFO simulation with three processes:

​
Input Configuration

Algorithm: FIFO
Number of processes: 3

Process 1:
  Arrival: 0
  CPU: 5

Process 2:
  Arrival: 2
  CPU: 3

Process 3:
  Arrival: 4
  CPU: 2

​
Expected Results

After clicking Simular, you’ll see: 
P1 | Llegada: 0 | Inicio: 0 | Fin: 5 | Espera: 0 | Retorno: 5
P2 | Llegada: 2 | Inicio: 5 | Fin: 8 | Espera: 3 | Retorno: 6
P3 | Llegada: 4 | Inicio: 8 | Fin: 10 | Espera: 4 | Retorno: 6

Tiempo total: 10

​
Understanding the Metrics

  • Llegada (Arrival) - When the process entered the system
  • Inicio (Start) - When the process began executing
  • Fin (Finish) - When the process completed
  • Espera (Wait) - Time spent waiting in the ready queue
  • Retorno (Turnaround) - Total time from arrival to completion
Wait Time = Start Time - Arrival TimeTurnaround Time = Finish Time - Arrival Time

​
Visualization Interface

During the animated simulation, you’ll see:

​
CPU Display

A gradient purple box showing the currently executing process (P1, P2, etc.) or Idle when no process is running.

​
Ready Queue

Gray boxes representing processes waiting for CPU time. Processes appear in queue order based on the algorithm’s scheduling rules.

​
Gantt Chart Timeline

Indigo blocks building from left to right, each representing one time unit of execution. Hover over blocks to see them scale up.
The animation runs at 500ms per time unit. For long simulations, use the Pausar button to examine specific moments.

​
Comparing Algorithms

1

Record Results

After running a simulation, note the total execution time and average waiting time for your processes.
2

Return to Start

Click ⬅ Volver al inicio to return to algorithm selection.
3

Try Another Algorithm

Select a different algorithm (e.g., SJF) and enter the exact same process data.
4

Compare Performance

Observe how different algorithms produce different waiting times, execution orders, and efficiency.
For meaningful comparison, always use identical process configurations across algorithms. This isolates the impact of the scheduling strategy.

​
Round Robin Example

Round Robin adds time-slicing behavior: 
Algorithm: Round Robin
Quantum: 2
Number of processes: 3

Process 1: Arrival: 0, CPU: 5
Process 2: Arrival: 1, CPU: 4
Process 3: Arrival: 2, CPU: 2
With quantum = 2, each process executes for a maximum of 2 time units before moving to the back of the queue. Watch the CPU box and ready queue to see processes rotating through execution.

​
Next Steps

Installation Guide

Set up the simulator locally with Docker or static files

Algorithm Details

Learn how each scheduling algorithm works internally

Usage Guide

Advanced configuration and simulation techniques

Interpreting Results

Interpret metrics and compare algorithm efficiency

​
Troubleshooting

Ensure you’re using a modern browser (Chrome, Edge, Firefox, or Safari). The simulator requires JavaScript and may not work in older browsers.
Click the ▶ Iniciar button after seeing the results table. If the simulation already ran, click 🔄 Reiniciar then ▶ Iniciar.
Ensure all fields contain valid positive integers. Arrival and CPU times must be numbers greater than or equal to 0.
For MLFQ, enter comma-separated integers like 3,5,7 (no spaces). Each number represents the quantum for one priority level.

Build docs developers (and LLMs) love

Get started for freeTalk to us