mirror of https://github.com/k3s-io/k3s
![]() Automatic merge from submit-queue. If you want to cherry-pick this change to another branch, please follow the instructions <a href="https://github.com/kubernetes/community/blob/master/contributors/devel/cherry-picks.md">here</a>. Improve scheduler's performance by eliminating sorting of nodes by their score **What this PR does / why we need it**: Profiling scheduler, I noticed that scheduler spends a significant amount of time in sorting the nodes after we score them to find nodes with the highest score. Finding nodes with the highest score does not need sorting the array. This PR replaces the sort with a linear scan. Eliminating the sort results in over 10% improvement in throughput of the scheduler. Before (3 runs for 5000 nodes, scheduling 1000 pods in a cluster running 2000 pods): BenchmarkScheduling/5000Nodes/2000Pods-12 1000 20682552 ns/op BenchmarkScheduling/5000Nodes/2000Pods-12 1000 20464729 ns/op BenchmarkScheduling/5000Nodes/2000Pods-12 1000 21188906 ns/op After: BenchmarkScheduling/5000Nodes/2000Pods-12 1000 18485866 ns/op BenchmarkScheduling/5000Nodes/2000Pods-12 1000 18457749 ns/op BenchmarkScheduling/5000Nodes/2000Pods-12 1000 18418200 ns/op **Release note**: ```release-note Improve scheduler's performance by eliminating sorting of nodes by their score. ``` |
||
---|---|---|
.. | ||
equivalence | ||
BUILD | ||
extender.go | ||
extender_test.go | ||
generic_scheduler.go | ||
generic_scheduler_test.go | ||
scheduling_queue.go | ||
scheduling_queue_test.go |