mirror of
https://github.com/optim-enterprises-bv/kubernetes.git
synced 2025-11-04 04:08:16 +00:00
b6c75bee15
kubernetes#60525 introduced Balanced attached node volumes feature gate to include volume count for prioritizing nodes. The reason for introducing this flag was its usefulness in Red Hat OpenShift Online environment which is not being used any more. So, removing the flag as it helps in maintainability of the scheduler code base as mentioned at kubernetes#101489 (comment)
123 lines
4.1 KiB
Go
123 lines
4.1 KiB
Go
/*
|
|
Copyright 2019 The Kubernetes Authors.
|
|
|
|
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 noderesources
|
|
|
|
import (
|
|
"context"
|
|
"fmt"
|
|
|
|
v1 "k8s.io/api/core/v1"
|
|
"k8s.io/apimachinery/pkg/runtime"
|
|
"k8s.io/kubernetes/pkg/scheduler/apis/config"
|
|
"k8s.io/kubernetes/pkg/scheduler/apis/config/validation"
|
|
"k8s.io/kubernetes/pkg/scheduler/framework"
|
|
"k8s.io/kubernetes/pkg/scheduler/framework/plugins/feature"
|
|
"k8s.io/kubernetes/pkg/scheduler/framework/plugins/names"
|
|
)
|
|
|
|
// LeastAllocated is a score plugin that favors nodes with fewer allocation requested resources based on requested resources.
|
|
type LeastAllocated struct {
|
|
handle framework.Handle
|
|
resourceAllocationScorer
|
|
}
|
|
|
|
var _ = framework.ScorePlugin(&LeastAllocated{})
|
|
|
|
// LeastAllocatedName is the name of the plugin used in the plugin registry and configurations.
|
|
const LeastAllocatedName = names.NodeResourcesLeastAllocated
|
|
|
|
// Name returns name of the plugin. It is used in logs, etc.
|
|
func (la *LeastAllocated) Name() string {
|
|
return LeastAllocatedName
|
|
}
|
|
|
|
// Score invoked at the score extension point.
|
|
func (la *LeastAllocated) Score(ctx context.Context, state *framework.CycleState, pod *v1.Pod, nodeName string) (int64, *framework.Status) {
|
|
nodeInfo, err := la.handle.SnapshotSharedLister().NodeInfos().Get(nodeName)
|
|
if err != nil {
|
|
return 0, framework.AsStatus(fmt.Errorf("getting node %q from Snapshot: %w", nodeName, err))
|
|
}
|
|
|
|
// la.score favors nodes with fewer requested resources.
|
|
// It calculates the percentage of memory and CPU requested by pods scheduled on the node, and
|
|
// prioritizes based on the minimum of the average of the fraction of requested to capacity.
|
|
//
|
|
// Details:
|
|
// (cpu((capacity-sum(requested))*MaxNodeScore/capacity) + memory((capacity-sum(requested))*MaxNodeScore/capacity))/weightSum
|
|
return la.score(pod, nodeInfo)
|
|
}
|
|
|
|
// ScoreExtensions of the Score plugin.
|
|
func (la *LeastAllocated) ScoreExtensions() framework.ScoreExtensions {
|
|
return nil
|
|
}
|
|
|
|
// NewLeastAllocated initializes a new plugin and returns it.
|
|
func NewLeastAllocated(laArgs runtime.Object, h framework.Handle, fts feature.Features) (framework.Plugin, error) {
|
|
args, ok := laArgs.(*config.NodeResourcesLeastAllocatedArgs)
|
|
if !ok {
|
|
return nil, fmt.Errorf("want args to be of type NodeResourcesLeastAllocatedArgs, got %T", laArgs)
|
|
}
|
|
if err := validation.ValidateNodeResourcesLeastAllocatedArgs(nil, args); err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
resToWeightMap := make(resourceToWeightMap)
|
|
for _, resource := range (*args).Resources {
|
|
resToWeightMap[v1.ResourceName(resource.Name)] = resource.Weight
|
|
}
|
|
|
|
return &LeastAllocated{
|
|
handle: h,
|
|
resourceAllocationScorer: resourceAllocationScorer{
|
|
Name: LeastAllocatedName,
|
|
scorer: leastResourceScorer(resToWeightMap),
|
|
resourceToWeightMap: resToWeightMap,
|
|
enablePodOverhead: fts.EnablePodOverhead,
|
|
},
|
|
}, nil
|
|
}
|
|
|
|
func leastResourceScorer(resToWeightMap resourceToWeightMap) func(resourceToValueMap, resourceToValueMap) int64 {
|
|
return func(requested, allocable resourceToValueMap) int64 {
|
|
var nodeScore, weightSum int64
|
|
for resource, weight := range resToWeightMap {
|
|
resourceScore := leastRequestedScore(requested[resource], allocable[resource])
|
|
nodeScore += resourceScore * weight
|
|
weightSum += weight
|
|
}
|
|
if weightSum == 0 {
|
|
return 0
|
|
}
|
|
return nodeScore / weightSum
|
|
}
|
|
}
|
|
|
|
// The unused capacity is calculated on a scale of 0-MaxNodeScore
|
|
// 0 being the lowest priority and `MaxNodeScore` being the highest.
|
|
// The more unused resources the higher the score is.
|
|
func leastRequestedScore(requested, capacity int64) int64 {
|
|
if capacity == 0 {
|
|
return 0
|
|
}
|
|
if requested > capacity {
|
|
return 0
|
|
}
|
|
|
|
return ((capacity - requested) * int64(framework.MaxNodeScore)) / capacity
|
|
}
|