mirror of https://github.com/k3s-io/k3s
Metrics for predicate and priority evaluation
parent
2d2fa02337
commit
252ff1e5a6
|
@ -36,6 +36,7 @@ import (
|
||||||
"k8s.io/kubernetes/pkg/scheduler/algorithm"
|
"k8s.io/kubernetes/pkg/scheduler/algorithm"
|
||||||
"k8s.io/kubernetes/pkg/scheduler/algorithm/predicates"
|
"k8s.io/kubernetes/pkg/scheduler/algorithm/predicates"
|
||||||
schedulerapi "k8s.io/kubernetes/pkg/scheduler/api"
|
schedulerapi "k8s.io/kubernetes/pkg/scheduler/api"
|
||||||
|
"k8s.io/kubernetes/pkg/scheduler/metrics"
|
||||||
"k8s.io/kubernetes/pkg/scheduler/schedulercache"
|
"k8s.io/kubernetes/pkg/scheduler/schedulercache"
|
||||||
"k8s.io/kubernetes/pkg/scheduler/util"
|
"k8s.io/kubernetes/pkg/scheduler/util"
|
||||||
|
|
||||||
|
@ -131,6 +132,7 @@ func (g *genericScheduler) Schedule(pod *v1.Pod, nodeLister algorithm.NodeLister
|
||||||
}
|
}
|
||||||
|
|
||||||
trace.Step("Computing predicates")
|
trace.Step("Computing predicates")
|
||||||
|
startPredicateEvalTime := time.Now()
|
||||||
filteredNodes, failedPredicateMap, err := findNodesThatFit(pod, g.cachedNodeInfoMap, nodes, g.predicates, g.extenders, g.predicateMetaProducer, g.equivalenceCache, g.schedulingQueue)
|
filteredNodes, failedPredicateMap, err := findNodesThatFit(pod, g.cachedNodeInfoMap, nodes, g.predicates, g.extenders, g.predicateMetaProducer, g.equivalenceCache, g.schedulingQueue)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return "", err
|
return "", err
|
||||||
|
@ -143,11 +145,13 @@ func (g *genericScheduler) Schedule(pod *v1.Pod, nodeLister algorithm.NodeLister
|
||||||
FailedPredicates: failedPredicateMap,
|
FailedPredicates: failedPredicateMap,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
metrics.SchedulingAlgorithmPredicateEvaluationDuration.Observe(metrics.SinceInMicroseconds(startPredicateEvalTime))
|
||||||
|
|
||||||
trace.Step("Prioritizing")
|
trace.Step("Prioritizing")
|
||||||
|
startPriorityEvalTime := time.Now()
|
||||||
// When only one node after predicate, just use it.
|
// When only one node after predicate, just use it.
|
||||||
if len(filteredNodes) == 1 {
|
if len(filteredNodes) == 1 {
|
||||||
|
metrics.SchedulingAlgorithmPriorityEvaluationDuration.Observe(metrics.SinceInMicroseconds(startPriorityEvalTime))
|
||||||
return filteredNodes[0].Name, nil
|
return filteredNodes[0].Name, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -156,6 +160,7 @@ func (g *genericScheduler) Schedule(pod *v1.Pod, nodeLister algorithm.NodeLister
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return "", err
|
return "", err
|
||||||
}
|
}
|
||||||
|
metrics.SchedulingAlgorithmPriorityEvaluationDuration.Observe(metrics.SinceInMicroseconds(startPriorityEvalTime))
|
||||||
|
|
||||||
trace.Step("Selecting host")
|
trace.Step("Selecting host")
|
||||||
return g.selectHost(priorityList)
|
return g.selectHost(priorityList)
|
||||||
|
|
|
@ -25,8 +25,7 @@ import (
|
||||||
|
|
||||||
const schedulerSubsystem = "scheduler"
|
const schedulerSubsystem = "scheduler"
|
||||||
|
|
||||||
var BindingSaturationReportInterval = 1 * time.Second
|
// All the histogram based metrics have 1ms as size for the smallest bucket.
|
||||||
|
|
||||||
var (
|
var (
|
||||||
E2eSchedulingLatency = prometheus.NewHistogram(
|
E2eSchedulingLatency = prometheus.NewHistogram(
|
||||||
prometheus.HistogramOpts{
|
prometheus.HistogramOpts{
|
||||||
|
@ -44,6 +43,22 @@ var (
|
||||||
Buckets: prometheus.ExponentialBuckets(1000, 2, 15),
|
Buckets: prometheus.ExponentialBuckets(1000, 2, 15),
|
||||||
},
|
},
|
||||||
)
|
)
|
||||||
|
SchedulingAlgorithmPredicateEvaluationDuration = prometheus.NewHistogram(
|
||||||
|
prometheus.HistogramOpts{
|
||||||
|
Subsystem: schedulerSubsystem,
|
||||||
|
Name: "scheduling_algorithm_predicate_evaluation",
|
||||||
|
Help: "Scheduling algorithm predicate evaluation duration",
|
||||||
|
Buckets: prometheus.ExponentialBuckets(1000, 2, 15),
|
||||||
|
},
|
||||||
|
)
|
||||||
|
SchedulingAlgorithmPriorityEvaluationDuration = prometheus.NewHistogram(
|
||||||
|
prometheus.HistogramOpts{
|
||||||
|
Subsystem: schedulerSubsystem,
|
||||||
|
Name: "scheduling_algorithm_priority_evaluation",
|
||||||
|
Help: "Scheduling algorithm priority evaluation duration",
|
||||||
|
Buckets: prometheus.ExponentialBuckets(1000, 2, 15),
|
||||||
|
},
|
||||||
|
)
|
||||||
BindingLatency = prometheus.NewHistogram(
|
BindingLatency = prometheus.NewHistogram(
|
||||||
prometheus.HistogramOpts{
|
prometheus.HistogramOpts{
|
||||||
Subsystem: schedulerSubsystem,
|
Subsystem: schedulerSubsystem,
|
||||||
|
@ -63,6 +78,8 @@ func Register() {
|
||||||
prometheus.MustRegister(E2eSchedulingLatency)
|
prometheus.MustRegister(E2eSchedulingLatency)
|
||||||
prometheus.MustRegister(SchedulingAlgorithmLatency)
|
prometheus.MustRegister(SchedulingAlgorithmLatency)
|
||||||
prometheus.MustRegister(BindingLatency)
|
prometheus.MustRegister(BindingLatency)
|
||||||
|
prometheus.MustRegister(SchedulingAlgorithmPredicateEvaluationDuration)
|
||||||
|
prometheus.MustRegister(SchedulingAlgorithmPriorityEvaluationDuration)
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue