Task Scheduler Visualization

DAG-based dependency resolution with priority queue and backfilling

Speed:

Time

T=0

CPU Available

4/4

Ready Queue

2

Completed

0/5

Dependency Graph (DAG)

A

readyP1

2 CPU × 3t

B

pendingP1

2 CPU × 2t← A

C

pendingP1

1 CPU × 4t← A

D

pendingP1

4 CPU × 2t← B, C

E

readyP10

1 CPU × 1t

Execution Timeline

0

1

2

3

4

5

6

7

8

9

10

A

B

C

D

E

CPU

0/4

Event Log

No events yet. Click "Step" or "Play" to begin.

Task States

Pending

Ready

Running

Completed

Key Concepts

DAG - Tasks form a directed acyclic graph of dependencies
Priority Queue - Higher priority tasks scheduled first
Backfilling - Skip large tasks to fit smaller ones
Event-driven - Jump to next event instead of ticking