How it works
Why does it behave this way?
- 1
A layer that moves nothing
Why is coordination free here, and what can an orchestrator never observe or undo?
2 pages - 2
Graphs and time
What does an edge in a DAG claim, and how does failure travel along it?
2 pages - 3
Triggers
What do events buy, and why can an arrival stream never say a batch is complete?
3 pages - 4
Safe re-execution
Why is catchup a design error?
3 pages - 5
Deadlines, branches, graph shape
Why can an orchestrator not detect its own absence, and what makes a deadline a service level?
4 pages - 6
Teams and limits
Why is a dependency across an ownership boundary an organizational problem rather than a technical one?
2 pages - 7
Durable execution
How does logging every effect let one program survive crashes, and when is it better than a DAG?
3 pages - 8
Priority and the scheduler
Why does upstream priority rarely change who runs first, and how do backfills starve live work?
2 pages - 9
What orchestration forbids, and the price of each escape
What does orchestration forbid, what escapes exist, and what do they cost?