Set the constraints
Tasks run to completion without interruption. Dependencies must finish before their children can start.
THE COMPUTE SCHEDULING SANDBOXSIMULATION ONLY
01 / Establish the queue
Every task.
A place in time.
A job is never just a job. Map the work, the dependencies, and everything waiting for its turn.
Build your queueILLUSTRATIVE QUEUEWAITING
01
A / PrepareQueued
02
B / EmbedQueued
03
C / RenderQueued
Dependencies shape the order.
01 / 03
01 / WORKING SANDBOX
Give the queue a question.
Edit the example workload, then play the schedule.
Every number below is calculated locally.
Task queue 5 tasks
| ID | Task name | Duration / s | Memory / GB | Priority ↑ | Depends on | |
|---|---|---|---|---|---|---|
| A | ||||||
| B | ||||||
| C | ||||||
| D | ||||||
| E |
Dependencies use comma-separated IDs, e.g. B,C; leave the field to apply. Priority 9 goes first. All tasks arrive at time 0.
Total completion15 seconds
Average wait to start6.8 seconds
Slot utilization60 %
Completed at playhead0 / 5
Schedule playback
0.0s / 15sA Prepare dataset
Running
B Build embeddings
Dependency
C Render preview
Dependency
D Evaluate model
Dependency
E Package results
Dependency
Memory at playhead 2 / 8 GBOccupied slots 1 / 2Running A
Same workload. Different rules.
Take the assumptions and the full schedule with you.
02 / THE MODEL
Waiting is information.
Slotwake is a local rehearsal for compute work. It does not connect to a cluster, execute jobs, or predict production performance.
Watch what fits
The rule orders ready tasks. The scheduler admits the first tasks that fit available memory and slots, skipping those that cannot fit. Ties preserve queue order.
Compare the consequence
Wait measures time from arrival to start, including dependencies. Utilization measures occupied slot time. Model durations are fixed; network and startup costs are excluded.