Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Revert "Avoid full sort when selecting host with highest priority." #17343

Merged
merged 1 commit into from
Nov 17, 2015
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
39 changes: 20 additions & 19 deletions plugin/pkg/scheduler/generic_scheduler.go
Original file line number Diff line number Diff line change
Expand Up @@ -19,6 +19,7 @@ package scheduler
import (
"fmt"
"math/rand"
"sort"
"strings"
"sync"

Expand Down Expand Up @@ -87,32 +88,20 @@ func (g *genericScheduler) Schedule(pod *api.Pod, nodeLister algorithm.NodeListe
return g.selectHost(priorityList)
}

// This method takes a prioritized list of nodes, shuffles those with the highest scores to the
// front of the list, and then picks one randomly from the nodes that had the highest score.
// This method takes a prioritized list of nodes and sorts them in reverse order based on scores
// and then picks one randomly from the nodes that had the highest score
func (g *genericScheduler) selectHost(priorityList algorithm.HostPriorityList) (string, error) {
if len(priorityList) == 0 {
return "", fmt.Errorf("empty priorityList")
}
max := priorityList[0].Score
n := 0
for i, hostEntry := range priorityList {
if hostEntry.Score < max {
continue
}
if hostEntry.Score > max {
max = hostEntry.Score
n = 0
}
priorityList[i], priorityList[n] = priorityList[n], priorityList[i]
n++
}
if n == 1 {
return priorityList[0].Host, nil
}
sort.Sort(sort.Reverse(priorityList))

hosts := getBestHosts(priorityList)
g.randomLock.Lock()
defer g.randomLock.Unlock()
return priorityList[g.random.Intn(n)].Host, nil

ix := g.random.Int() % len(hosts)
return hosts[ix], nil
}

// Filters the nodes to find the ones that fit based on the given predicate functions
Expand Down Expand Up @@ -190,6 +179,18 @@ func PrioritizeNodes(pod *api.Pod, podLister algorithm.PodLister, priorityConfig
return result, nil
}

func getBestHosts(list algorithm.HostPriorityList) []string {
result := []string{}
for _, hostEntry := range list {
if hostEntry.Score == list[0].Score {
result = append(result, hostEntry.Host)
} else {
break
}
}
return result
}

// EqualPriority is a prioritizer function that gives an equal weight of one to all nodes
func EqualPriority(_ *api.Pod, podLister algorithm.PodLister, nodeLister algorithm.NodeLister) (algorithm.HostPriorityList, error) {
nodes, err := nodeLister.List()
Expand Down