YuniKorn currently sorts all nodes on demand whenever scheduling of a container occurs. This causes significant performance degradation as the number of nodes increases.
If we replace the on-demand sorting with a B-Tree sorted proactively, we can improve performance considerably.
This is a similar approach to
YUNIKORN-21, but without the associated behavioral changes.
I've attached a design document with the details of the approach and the performance improvement gained.