single mention · inference & serving
Greedy feasible-rank placement
Selects the feasible rank with the greatest remaining capacity.
The sources on this page only mention it in passing. The line above is the extraction's one-line gloss. See inference scheduling for the methods filed beside it.
Also called greedy heuristic.
Filed under inference & serving › inference scheduling