/* Copyright 2016 The Kubernetes Authors All rights reserved. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */ package priorities import ( "github.com/golang/glog" "k8s.io/kubernetes/pkg/api" "k8s.io/kubernetes/pkg/labels" "k8s.io/kubernetes/plugin/pkg/scheduler/algorithm" "k8s.io/kubernetes/plugin/pkg/scheduler/algorithm/predicates" priorityutil "k8s.io/kubernetes/plugin/pkg/scheduler/algorithm/priorities/util" schedulerapi "k8s.io/kubernetes/plugin/pkg/scheduler/api" "k8s.io/kubernetes/plugin/pkg/scheduler/schedulercache" ) type InterPodAffinity struct { info predicates.NodeInfo nodeLister algorithm.NodeLister podLister algorithm.PodLister hardPodAffinityWeight int failureDomains priorityutil.Topologies } func NewInterPodAffinityPriority(info predicates.NodeInfo, nodeLister algorithm.NodeLister, podLister algorithm.PodLister, hardPodAffinityWeight int, failureDomains []string) algorithm.PriorityFunction { interPodAffinity := &InterPodAffinity{ info: info, nodeLister: nodeLister, podLister: podLister, hardPodAffinityWeight: hardPodAffinityWeight, failureDomains: priorityutil.Topologies{DefaultKeys: failureDomains}, } return interPodAffinity.CalculateInterPodAffinityPriority } // countPodsThatMatchPodAffinityTerm counts the number of given pods that match the podAffinityTerm. func (ipa *InterPodAffinity) CountPodsThatMatchPodAffinityTerm(pod *api.Pod, podsForMatching []*api.Pod, node *api.Node, podAffinityTerm api.PodAffinityTerm) (int, error) { matchedCount := 0 for _, ep := range podsForMatching { match, err := ipa.failureDomains.CheckIfPodMatchPodAffinityTerm(ep, pod, podAffinityTerm, func(ep *api.Pod) (*api.Node, error) { return ipa.info.GetNodeInfo(ep.Spec.NodeName) }, func(pod *api.Pod) (*api.Node, error) { return node, nil }, ) if err != nil { return 0, err } if match { matchedCount++ } } return matchedCount, nil } // CountWeightByPodMatchAffinityTerm counts the weight to topologyCounts for all the given pods that match the podAffinityTerm. func (ipa *InterPodAffinity) CountWeightByPodMatchAffinityTerm(pod *api.Pod, podsForMatching []*api.Pod, weight int, podAffinityTerm api.PodAffinityTerm, node *api.Node) (int, error) { if weight == 0 { return 0, nil } // get the pods which are there in that particular node podsMatchedCount, err := ipa.CountPodsThatMatchPodAffinityTerm(pod, podsForMatching, node, podAffinityTerm) return weight * podsMatchedCount, err } // compute a sum by iterating through the elements of weightedPodAffinityTerm and adding // "weight" to the sum if the corresponding PodAffinityTerm is satisfied for // that node; the node(s) with the highest sum are the most preferred. // Symmetry need to be considered for preferredDuringSchedulingIgnoredDuringExecution from podAffinity & podAntiAffinity, // symmetry need to be considered for hard requirements from podAffinity func (ipa *InterPodAffinity) CalculateInterPodAffinityPriority(pod *api.Pod, nodeNameToInfo map[string]*schedulercache.NodeInfo, nodeLister algorithm.NodeLister) (schedulerapi.HostPriorityList, error) { nodes, err := nodeLister.List() if err != nil { return nil, err } allPods, err := ipa.podLister.List(labels.Everything()) if err != nil { return nil, err } affinity, err := api.GetAffinityFromPodAnnotations(pod.Annotations) if err != nil { return nil, err } // convert the topology key based weights to the node name based weights var maxCount int var minCount int counts := map[string]int{} for _, node := range nodes.Items { totalCount := 0 // count weights for the weighted pod affinity if affinity.PodAffinity != nil { for _, weightedTerm := range affinity.PodAffinity.PreferredDuringSchedulingIgnoredDuringExecution { weightedCount, err := ipa.CountWeightByPodMatchAffinityTerm(pod, allPods, weightedTerm.Weight, weightedTerm.PodAffinityTerm, &node) if err != nil { return nil, err } totalCount += weightedCount } } // count weights for the weighted pod anti-affinity if affinity.PodAntiAffinity != nil { for _, weightedTerm := range affinity.PodAntiAffinity.PreferredDuringSchedulingIgnoredDuringExecution { weightedCount, err := ipa.CountWeightByPodMatchAffinityTerm(pod, allPods, (0 - weightedTerm.Weight), weightedTerm.PodAffinityTerm, &node) if err != nil { return nil, err } totalCount += weightedCount } } // reverse direction checking: count weights for the inter-pod affinity/anti-affinity rules // that are indicated by existing pods on the node. for _, ep := range allPods { epAffinity, err := api.GetAffinityFromPodAnnotations(ep.Annotations) if err != nil { return nil, err } if epAffinity.PodAffinity != nil { // count the implicit weight for the hard pod affinity indicated by the existing pod. if ipa.hardPodAffinityWeight > 0 { var podAffinityTerms []api.PodAffinityTerm if len(epAffinity.PodAffinity.RequiredDuringSchedulingIgnoredDuringExecution) != 0 { podAffinityTerms = epAffinity.PodAffinity.RequiredDuringSchedulingIgnoredDuringExecution } // TODO: Uncomment this block when implement RequiredDuringSchedulingRequiredDuringExecution. //if len(affinity.PodAffinity.RequiredDuringSchedulingRequiredDuringExecution) != 0 { // podAffinityTerms = append(podAffinityTerms, affinity.PodAffinity.RequiredDuringSchedulingRequiredDuringExecution...) //} for _, epAffinityTerm := range podAffinityTerms { match, err := ipa.failureDomains.CheckIfPodMatchPodAffinityTerm(pod, ep, epAffinityTerm, func(pod *api.Pod) (*api.Node, error) { return &node, nil }, func(ep *api.Pod) (*api.Node, error) { return ipa.info.GetNodeInfo(ep.Spec.NodeName) }, ) if err != nil { return nil, err } if match { totalCount += ipa.hardPodAffinityWeight } } } // count weight for the weighted pod affinity indicated by the existing pod. for _, epWeightedTerm := range epAffinity.PodAffinity.PreferredDuringSchedulingIgnoredDuringExecution { match, err := ipa.failureDomains.CheckIfPodMatchPodAffinityTerm(pod, ep, epWeightedTerm.PodAffinityTerm, func(pod *api.Pod) (*api.Node, error) { return &node, nil }, func(ep *api.Pod) (*api.Node, error) { return ipa.info.GetNodeInfo(ep.Spec.NodeName) }, ) if err != nil { return nil, err } if match { totalCount += epWeightedTerm.Weight } } } // count weight for the weighted pod anti-affinity indicated by the existing pod. if epAffinity.PodAntiAffinity != nil { for _, epWeightedTerm := range epAffinity.PodAntiAffinity.PreferredDuringSchedulingIgnoredDuringExecution { match, err := ipa.failureDomains.CheckIfPodMatchPodAffinityTerm(pod, ep, epWeightedTerm.PodAffinityTerm, func(pod *api.Pod) (*api.Node, error) { return &node, nil }, func(ep *api.Pod) (*api.Node, error) { return ipa.info.GetNodeInfo(ep.Spec.NodeName) }, ) if err != nil { return nil, err } if match { totalCount -= epWeightedTerm.Weight } } } } counts[node.Name] = totalCount if counts[node.Name] > maxCount { maxCount = counts[node.Name] } if counts[node.Name] < minCount { minCount = counts[node.Name] } } // calculate final priority score for each node result := []schedulerapi.HostPriority{} for _, node := range nodes.Items { fScore := float64(0) if (maxCount - minCount) > 0 { fScore = 10 * (float64(counts[node.Name]-minCount) / float64(maxCount-minCount)) } result = append(result, schedulerapi.HostPriority{Host: node.Name, Score: int(fScore)}) glog.V(10).Infof( "%v -> %v: InterPodAffinityPriority, Score: (%d)", pod.Name, node.Name, int(fScore), ) } return result, nil }