What placement forbids
What this article forbids
- You cannot be concentrated for bandwidth and dispersed for failure at the same time. They are the same axis.
- You cannot exceed the utilization ceiling set by shape mismatch, whatever the algorithm.
- You cannot enforce a constraint the scheduler has no name for.
- You cannot make a lifetime-valid placement with a point-in-time decision.
Escapes and prices
| Escape | Buys | Pays |
|---|---|---|
| Relaxation ladders | feasibility | unpredictable performance (the same task runs at two speeds depending on where it landed) |
| Constraints (anti-affinity) | independence | packing density and search cost |
| Spot | 60–90% off | lost work, and correlation you must actively diversify against |
| Shape menus (instance families) | less stranding | fleet complexity |
| Descheduling | durable constraints | preemption: the collector always costs what the mutation saved |