forked from kai-scheduler/KAI-Scheduler
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsession_plugins.go
More file actions
540 lines (454 loc) · 16.3 KB
/
Copy pathsession_plugins.go
File metadata and controls
540 lines (454 loc) · 16.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
/*
Copyright 2018 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.
*/
// Copyright 2025 NVIDIA CORPORATION
// SPDX-License-Identifier: Apache-2.0
package framework
import (
"fmt"
"maps"
"net/http"
"github.com/kai-scheduler/KAI-scheduler/pkg/common/constants"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/common_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/node_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/pod_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/podgroup_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/podgroup_info/subgroup_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/queue_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/api/resource_info"
"github.com/kai-scheduler/KAI-scheduler/pkg/scheduler/log"
)
func (ssn *Session) AddGPUOrderFn(gof api.GpuOrderFn) {
ssn.GpuOrderFns = append(ssn.GpuOrderFns, gof)
}
func (ssn *Session) AddNodePreOrderFn(npof api.NodePreOrderFn) {
ssn.NodePreOrderFns = append(ssn.NodePreOrderFns, npof)
}
func (ssn *Session) AddNodeOrderFn(nof api.NodeOrderFn) {
ssn.NodeOrderFns = append(ssn.NodeOrderFns, nof)
}
func (ssn *Session) AddPrePredicateFn(pf api.PrePredicateFn) {
ssn.PrePredicateFns = append(ssn.PrePredicateFns, pf)
}
func (ssn *Session) AddVictimInvariantPrePredicateFn(pf api.VictimInvariantPrePredicateFn) {
ssn.VictimInvariantPrePredicateFns = append(ssn.VictimInvariantPrePredicateFns, pf)
}
func (ssn *Session) AddSubsetNodesFn(snf api.SubsetNodesFn) {
ssn.SubsetNodesFns = append(ssn.SubsetNodesFns, snf)
}
func (ssn *Session) AddPredicateFn(pf api.PredicateFn) {
ssn.PredicateFns = append(ssn.PredicateFns, pf)
}
func (ssn *Session) AddJobOrderFn(jof common_info.CompareFn) {
ssn.JobOrderFns = append(ssn.JobOrderFns, jof)
}
// AddVictimOrderFn registers a comparator used only to rank candidate
// eviction victims, without affecting pending-job allocation order.
//
// The registered JobOrderFns chain is always checked first (inverted,
// matching existing allocation-order semantics); comparators registered
// here apply only as a tiebreak, when every JobOrderFn treats l and r as
// equal. This ensures job-level protections (e.g. elastic at-min/above-min
// status) take precedence over any victim-specific comparator.
//
// Sign convention: vof(l, r) < 0 means l should be evicted before r. This
// is the direct, non-inverted sense -- unlike the JobOrderFn chain, which
// VictimOrderFn inverts internally when using it for the eviction path.
func (ssn *Session) AddVictimOrderFn(vof common_info.CompareFn) {
ssn.VictimOrderFns = append(ssn.VictimOrderFns, vof)
}
func (ssn *Session) AddTaskOrderFn(tof common_info.CompareFn) {
ssn.TaskOrderFns = append(ssn.TaskOrderFns, tof)
}
func (ssn *Session) AddSubGroupOrderFn(ssof common_info.CompareFn) {
ssn.SubGroupOrderFns = append(ssn.SubGroupOrderFns, ssof)
}
func (ssn *Session) AddQueueOrderFn(qof api.CompareQueueFn) {
ssn.QueueOrderFns = append(ssn.QueueOrderFns, qof)
}
func (ssn *Session) AddOnJobSolutionStartFn(jssf api.OnJobSolutionStartFn) {
ssn.OnJobSolutionStartFns = append(ssn.OnJobSolutionStartFns, jssf)
}
func (ssn *Session) AddGetQueueAllocatedResourcesFn(of api.QueueResource) {
ssn.GetQueueAllocatedResourcesFns = append(ssn.GetQueueAllocatedResourcesFns, of)
}
func (ssn *Session) AddPreemptVictimFilterFn(pf api.VictimFilterFn) {
ssn.PreemptVictimFilterFns = append(ssn.PreemptVictimFilterFns, pf)
}
func (ssn *Session) AddCanReclaimResourcesFn(crf api.CanReclaimResourcesFn) {
ssn.CanReclaimResourcesFns = append(ssn.CanReclaimResourcesFns, crf)
}
func (ssn *Session) AddReclaimScenarioValidatorFn(rf api.ScenarioValidatorFn) {
ssn.ReclaimScenarioValidatorFns = append(ssn.ReclaimScenarioValidatorFns, rf)
}
func (ssn *Session) AddPreemptScenarioValidatorFn(rf api.ScenarioValidatorFn) {
ssn.PreemptScenarioValidatorFns = append(ssn.PreemptScenarioValidatorFns, rf)
}
func (ssn *Session) AddReclaimVictimFilterFn(rf api.VictimFilterFn) {
ssn.ReclaimVictimFilterFns = append(ssn.ReclaimVictimFilterFns, rf)
}
func (ssn *Session) AddBindRequestMutateFn(fn api.BindRequestMutateFn) {
ssn.BindRequestMutateFns = append(ssn.BindRequestMutateFns, fn)
}
func (ssn *Session) AddNumaPlacementFn(fn api.NumaPlacementFn) {
if ssn.NumaPlacementFn != nil {
log.InfraLogger.Errorf("NumaPlacementFn already registered; ignoring duplicate registration")
return
}
ssn.NumaPlacementFn = fn
}
func (ssn *Session) GetNumaPlacement(task *pod_info.PodInfo, node *node_info.NodeInfo) pod_info.NUMAPlacement {
if ssn.NumaPlacementFn == nil {
return nil
}
return ssn.NumaPlacementFn(task, node)
}
func (ssn *Session) AddPreJobAllocationFn(fn api.PreJobAllocationFn) {
ssn.PreJobAllocationFns = append(ssn.PreJobAllocationFns, fn)
}
func (ssn *Session) AddScenarioGenerator(name string, factory ScenarioGeneratorFactory) {
ssn.ScenarioGeneratorRegistrations = append(ssn.ScenarioGeneratorRegistrations, ScenarioGeneratorRegistration{
Name: name,
Factory: factory,
})
}
func (ssn *Session) ValidateScenarioGeneratorBudgetKeys() error {
if ssn.Config == nil || ssn.Config.ScenarioSearchBudgets == nil {
return nil
}
known := map[string]struct{}{
constants.ActionDefault: {},
constants.GeneratorNodeLocalGreedy: {},
constants.GeneratorMultiNodeGang: {},
}
for _, registration := range ssn.ScenarioGeneratorRegistrations {
known[registration.Name] = struct{}{}
}
for name := range ssn.Config.ScenarioSearchBudgets.MaxGeneratorSearchDuration {
if _, ok := known[name]; !ok {
return fmt.Errorf("unknown scenario generator budget key %q", name)
}
}
return nil
}
func (ssn *Session) CanReclaimResources(reclaimer *podgroup_info.PodGroupInfo) bool {
for _, canReclaimFn := range ssn.CanReclaimResourcesFns {
return canReclaimFn(reclaimer)
}
return false
}
func (ssn *Session) ReclaimVictimFilter(reclaimer *podgroup_info.PodGroupInfo, victim *podgroup_info.PodGroupInfo) bool {
for _, rf := range ssn.ReclaimVictimFilterFns {
if !rf(reclaimer, victim) {
return false
}
}
return true
}
func (ssn *Session) ReclaimScenarioValidatorFn(scenario api.ScenarioInfo) bool {
for _, rf := range ssn.ReclaimScenarioValidatorFns {
if !rf(scenario) {
return false
}
}
return true
}
func (ssn *Session) PreemptVictimFilter(preemptor *podgroup_info.PodGroupInfo, victim *podgroup_info.PodGroupInfo) bool {
for _, pf := range ssn.PreemptVictimFilterFns {
if !pf(preemptor, victim) {
return false
}
}
return true
}
func (ssn *Session) PreemptScenarioValidator(
scenario api.ScenarioInfo,
) bool {
for _, pf := range ssn.PreemptScenarioValidatorFns {
if !pf(scenario) {
return false
}
}
return true
}
func (ssn *Session) AddHttpHandler(path string, handler func(http.ResponseWriter, *http.Request)) {
if server == nil {
return
}
err := server.registerPlugin(path, handler)
if err != nil {
log.InfraLogger.Errorf("Failed to register plugin %s: %v", path, err)
}
}
func (ssn *Session) OnJobSolutionStart() {
for _, jssf := range ssn.OnJobSolutionStartFns {
jssf()
}
}
func (ssn *Session) QueueDeservedResources(queue *queue_info.QueueInfo) *resource_info.ResourceRequirements {
for _, of := range ssn.GetQueueDeservedResourcesFns {
return of(queue)
}
return nil
}
func (ssn *Session) AddGetQueueDeservedResourcesFn(of api.QueueResource) {
ssn.GetQueueDeservedResourcesFns = append(ssn.GetQueueDeservedResourcesFns, of)
}
func (ssn *Session) AddGetQueueFairShareFn(of api.QueueResource) {
ssn.GetQueueFairShareFns = append(ssn.GetQueueFairShareFns, of)
}
func (ssn *Session) AddIsNonPreemptibleJobOverQueueQuotaFns(of api.IsJobOverCapacityFn) {
ssn.IsNonPreemptibleJobOverQueueQuotaFns = append(ssn.IsNonPreemptibleJobOverQueueQuotaFns, of)
}
func (ssn *Session) AddIsJobOverCapacityFn(of api.IsJobOverCapacityFn) {
ssn.IsJobOverCapacityFns = append(ssn.IsJobOverCapacityFns, of)
}
func (ssn *Session) AddIsTaskAllocationOnNodeOverCapacityFn(of api.IsTaskAllocationOverCapacityFn) {
ssn.IsTaskAllocationOnNodeOverCapacityFns = append(ssn.IsTaskAllocationOnNodeOverCapacityFns, of)
}
func (ssn *Session) QueueFairShare(queue *queue_info.QueueInfo) *resource_info.ResourceRequirements {
for _, of := range ssn.GetQueueFairShareFns {
return of(queue)
}
return nil
}
func (ssn *Session) QueueAllocatedResources(queue *queue_info.QueueInfo) *resource_info.ResourceRequirements {
for _, of := range ssn.GetQueueAllocatedResourcesFns {
return of(queue)
}
return nil
}
func jobOrderCreationFallback(l, r interface{}) bool {
lv := l.(*podgroup_info.PodGroupInfo)
rv := r.(*podgroup_info.PodGroupInfo)
if lv.CreationTimestamp.Equal(&rv.CreationTimestamp) {
return lv.UID < rv.UID
}
return lv.CreationTimestamp.Before(&rv.CreationTimestamp)
}
func (ssn *Session) JobOrderFn(l, r interface{}) bool {
for _, jof := range ssn.JobOrderFns {
if j := jof(l, r); j != 0 {
return j < 0
}
}
return jobOrderCreationFallback(l, r)
}
// VictimOrderFn reports whether l should be evicted before r.
//
// The JobOrderFns chain is consulted first, inverted; VictimOrderFns
// registered via AddVictimOrderFn apply only when every JobOrderFn treats
// l and r as equal. With no VictimOrderFns registered, this reduces to
// the original !JobOrderFn(l, r) behavior.
func (ssn *Session) VictimOrderFn(l, r interface{}) bool {
for _, jof := range ssn.JobOrderFns {
if j := jof(l, r); j != 0 {
return j > 0
}
}
for _, vof := range ssn.VictimOrderFns {
if v := vof(l, r); v != 0 {
return v < 0
}
}
return !jobOrderCreationFallback(l, r)
}
func (ssn *Session) TaskOrderFn(l, r interface{}) bool {
for _, compareTasks := range ssn.TaskOrderFns {
if comparison := compareTasks(l, r); comparison != 0 {
return comparison < 0
}
}
// As a fallback, order tasks by CreationTimestamp first, then by UID.
lv := l.(*pod_info.PodInfo)
rv := r.(*pod_info.PodInfo)
if lv.Pod.CreationTimestamp.Equal(&rv.Pod.CreationTimestamp) {
return lv.UID < rv.UID
} else {
return lv.Pod.CreationTimestamp.Before(&rv.Pod.CreationTimestamp)
}
}
func (ssn *Session) SubGroupOrderFn(l, r interface{}) bool {
lSubGroupSet := l.(subgroup_info.SubGroupMember)
rSubGroupSet := r.(subgroup_info.SubGroupMember)
for _, compareFn := range ssn.SubGroupOrderFns {
if comparison := compareFn(lSubGroupSet, rSubGroupSet); comparison != 0 {
return comparison < 0
}
}
return lSubGroupSet.GetName() < rSubGroupSet.GetName()
}
func (ssn *Session) QueueOrderFn(lQ, rQ *queue_info.QueueInfo, lJob, rJob *podgroup_info.PodGroupInfo,
lVictims, rVictims []*podgroup_info.PodGroupInfo,
) bool {
minNodeGPUMemory := ssn.ClusterInfo.MinNodeGPUMemoryMiB
for _, qof := range ssn.QueueOrderFns {
if j := qof(lQ, rQ, lJob, rJob, lVictims, rVictims, minNodeGPUMemory); j != 0 {
return j < 0
}
}
// If no queue order funcs, order queue by CreationTimestamp first, then by UID.
if lQ.CreationTimestamp.Equal(&rQ.CreationTimestamp) {
return lQ.UID < rQ.UID
}
return lQ.CreationTimestamp.Before(&rQ.CreationTimestamp)
}
func (ssn *Session) IsNonPreemptibleJobOverQueueQuotaFn(job *podgroup_info.PodGroupInfo,
tasksToAllocate []*pod_info.PodInfo) *api.SchedulableResult {
for _, fn := range ssn.IsNonPreemptibleJobOverQueueQuotaFns {
return fn(job, tasksToAllocate)
}
return &api.SchedulableResult{
IsSchedulable: true,
Reason: "",
Message: "",
Details: nil,
}
}
func (ssn *Session) IsJobOverQueueCapacityFn(job *podgroup_info.PodGroupInfo,
tasksToAllocate []*pod_info.PodInfo) *api.SchedulableResult {
for _, fn := range ssn.IsJobOverCapacityFns {
return fn(job, tasksToAllocate)
}
return &api.SchedulableResult{
IsSchedulable: true,
Reason: "",
Message: "",
Details: nil,
}
}
func (ssn *Session) IsTaskAllocationOnNodeOverCapacityFn(task *pod_info.PodInfo, job *podgroup_info.PodGroupInfo,
node *node_info.NodeInfo) *api.SchedulableResult {
for _, fn := range ssn.IsTaskAllocationOnNodeOverCapacityFns {
return fn(task, job, node)
}
return &api.SchedulableResult{
IsSchedulable: true,
Reason: "",
Message: "",
Details: nil,
}
}
func (ssn *Session) SubsetNodesFn(
podGroup *podgroup_info.PodGroupInfo, subGroupInfo *subgroup_info.SubGroupInfo,
podSets map[string]*subgroup_info.PodSet, tasks []*pod_info.PodInfo, initNodeSet node_info.NodeSet,
) ([]node_info.NodeSet, error) {
nodeSets := []node_info.NodeSet{initNodeSet}
for _, subsetNodesFn := range ssn.SubsetNodesFns {
log.InfraLogger.V(7).Infof(
"Running plugin func <%v> on podGroup <%s/%s>", subsetNodesFn, podGroup.Namespace, podGroup.Namespace)
var newNodeSets []node_info.NodeSet
for _, nodeSet := range nodeSets {
nodeSubsets, err := subsetNodesFn(podGroup, subGroupInfo, podSets, tasks, nodeSet)
if err != nil {
return nil, err
}
newNodeSets = append(newNodeSets, nodeSubsets...)
}
nodeSets = newNodeSets
logNodeSetsPluginResult(subsetNodesFn, podGroup, nodeSets)
}
return nodeSets, nil
}
func logNodeSetsPluginResult(subsetNodesFn api.SubsetNodesFn, podGroup *podgroup_info.PodGroupInfo, nodeSets []node_info.NodeSet) {
log.InfraLogger.V(7).Do(func() {
nodeSetNames := make([][]string, 0, len(nodeSets))
for _, nodeSet := range nodeSets {
names := make([]string, 0, len(nodeSet))
for _, node := range nodeSet {
names = append(names, node.Name)
}
nodeSetNames = append(nodeSetNames, names)
}
log.InfraLogger.V(7).Infof(
"Result of plugin func <%v> on podGroup <%s/%s> is %v", subsetNodesFn, podGroup.Namespace, podGroup.Namespace,
nodeSetNames)
})
}
func (ssn *Session) PrePredicateFn(task *pod_info.PodInfo, job *podgroup_info.PodGroupInfo) error {
for _, prePredicate := range ssn.PrePredicateFns {
err := prePredicate(task, job)
if err != nil {
log.InfraLogger.V(6).Infof(
"Failed to run Pre-Predicate on task %s", task.Name)
return err
}
}
return nil
}
func (ssn *Session) VictimInvariantPrePredicateFailure(
task *pod_info.PodInfo,
) *api.VictimInvariantPrePredicateFailure {
for _, prePredicate := range ssn.VictimInvariantPrePredicateFns {
if failure := prePredicate(task); failure != nil {
return failure
}
}
return nil
}
func (ssn *Session) PredicateFn(task *pod_info.PodInfo, job *podgroup_info.PodGroupInfo, node *node_info.NodeInfo) error {
for _, pfn := range ssn.PredicateFns {
err := pfn(task, job, node)
if err != nil {
log.InfraLogger.V(6).Infof(
"Failed to run Predicate on task %s", task.Name)
return err
}
}
return nil
}
func (ssn *Session) GpuOrderFn(task *pod_info.PodInfo, node *node_info.NodeInfo, gpuIdx string) (float64, error) {
score := float64(0)
for _, gof := range ssn.GpuOrderFns {
pluginScore, err := gof(task, node, gpuIdx)
if err != nil {
return 0, err
}
score += pluginScore
}
return score, nil
}
func (ssn *Session) NodePreOrderFn(task *pod_info.PodInfo, fittingNodes []*node_info.NodeInfo) {
for _, nodePreOrderFn := range ssn.NodePreOrderFns {
if err := nodePreOrderFn(task, fittingNodes); err != nil {
log.InfraLogger.Errorf(
"Failed to run pre-order on task %s: %v", task.Name, err)
}
}
}
func (ssn *Session) NodeOrderFn(task *pod_info.PodInfo, node *node_info.NodeInfo) (float64, error) {
priorityScore := float64(0)
for _, nodeOrderFn := range ssn.NodeOrderFns {
score, err := nodeOrderFn(task, node)
if err != nil {
return 0, err
}
priorityScore += score
}
return priorityScore, nil
}
func (ssn *Session) IsRestrictNodeSchedulingEnabled() bool {
return ssn.SchedulerParams.RestrictSchedulingNodes
}
func (ssn *Session) MutateBindRequestAnnotations(pod *pod_info.PodInfo, nodeName string) map[string]string {
annotations := map[string]string{}
for _, fn := range ssn.BindRequestMutateFns {
maps.Copy(annotations, fn(pod, nodeName))
}
return annotations
}
func (ssn *Session) PreJobAllocation(job *podgroup_info.PodGroupInfo) {
for _, preJobAllocationFn := range ssn.PreJobAllocationFns {
preJobAllocationFn(job)
}
}