fragmentation

Trace one cache position through a block table, calculate the memory recovered from oversized reservations, and explain why sharing still needs careful writes and matching.

Design fractional GPU admission around explicit shapes and enforceable guarantees, then reconcile reservations with the runtime.

Count feasible placements for the waiting job, including its per-node and topology requirements. Then compare waiting, reservations and checkpoint/restart consolidation using their actual disruption costs.

Trace the job from quota reservation through admission to physical placement. Count eligible node shapes, not just free GPUs, and use controller and scheduler evidence to choose the least disruptive fix.

Compare three GPU placement heuristics with executable traces. Show how admission and free-space shape change, then add workload and topology constraints.