Summary:

• Summary from PTG

PCI and VGPU Scheduling Performance in Placement

The team revisited the performance issues with PCI and VGPU scheduling in Placement.
Two workaround sets have already been implemented to reduce the number of valid and invalid candidates, but the core scalability problem of the GET /allocation_candidates query remains, especially in large, symmetric provider trees.

A long-term constraint solver approach is under consideration, and the discussion will continue once more data is available from current deployments.

 Keep the current workarounds active and gather feedback over the next six months.
Nova-next may run with these settings enabled to collect early results.
Revisit the topic and defaulting decisions at the next PTG.
Keep the issue open for urgent improvements if needed before the next cycle.

Goal:

TimeBox:

• Sprint

Deliverables/Outcomes: