Task Scheduling Calculator

Calculator

Add tasks, select an algorithm, then calculate.

Algorithm

Priority uses smaller numbers as higher priority.

Quantum (Round Robin)

Used only for Round Robin scheduling.

Options

Results appear above this form after submission.

Tips: Use integer times for preemptive methods. Add an idle gap by setting later arrivals.

Use this dataset to compare algorithms quickly.

PID	Arrival	Burst	Priority
T1	0	7	2
T2	2	4	1
T3	4	1	3
T4	5	4	2

Total elapsed time is measured from the first task arrival to the final completion, including any idle intervals.

1) What does “burst time” mean?

Burst time is the total CPU time a task needs to finish, excluding waiting and idle periods.

2) Which priority value is considered higher?

Lower numeric values are treated as higher priority. For example, priority 1 runs before priority 2 when both are ready.

3) Why do preemptive results differ from non-preemptive results?

Preemptive methods can interrupt a running task when a better candidate arrives, which changes start times, waiting time, and completion order.

4) What does the Gantt timeline show?

It shows which task runs during each time interval. “IDLE” appears when no task has arrived or all ready tasks are finished.

5) How should I pick a Round Robin quantum?

A smaller quantum improves responsiveness but increases context switching. A larger quantum reduces switching but behaves closer to FCFS.

6) Can I use fractional times?

Use integer times for the most accurate preemptive simulations here. Non-preemptive algorithms work best with integer inputs as well.

7) What do I export in CSV and PDF?

Exports include summary metrics, a per-task table, and Gantt intervals. They always reflect the most recent calculation you ran.