Skip to content
About
Main content

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 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

EscapeBuysPays
Relaxation laddersfeasibilityunpredictable performance (the same task runs at two speeds depending on where it landed)
Constraints ()independencepacking density and search cost
60–90% offlost work, and correlation you must actively diversify against
Shape menus (instance families)less strandingfleet complexity
Deschedulingdurable constraints: the collector always costs what the mutation saved