Improve MIG profile placement and template selection so that each allocation preserves the largest possible contiguous free region and reduces fragmentation.
For common seven-slice GPUs, such as an A100 configured as 7 × 1g, a greedy strategy can be used:
- Process profiles that require more slices first.
- Evaluate the remaining contiguous space after each candidate placement.
- Prefer placements that do not split a large free region into smaller fragments.
- Use a stable and deterministic placement order when multiple candidates have the same score.
- Fall back to backtracking or exhaustive search when the greedy strategy cannot find a valid solution.
For example, a 1g instance should preferably be allocated from the edge of a free region so that the remaining contiguous slices can still accommodate 2g, 3g, or larger profiles.
The algorithm should cover:
- Multiple allocations of the same profile.
- Mixed small and large profiles.
- GPUs with existing active MIG instances.
- Cases where greedy selection fails but backtracking can still find a valid placement.
- Different GPU models, slice counts, and placement constraints reported by NVML.
Improve MIG profile placement and template selection so that each allocation preserves the largest possible contiguous free region and reduces fragmentation.
For common seven-slice GPUs, such as an A100 configured as
7 × 1g, a greedy strategy can be used:For example, a
1ginstance should preferably be allocated from the edge of a free region so that the remaining contiguous slices can still accommodate2g,3g, or larger profiles.The algorithm should cover: