- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 99 for nominator (0.18 sec)
-
pkg/scheduler/internal/queue/scheduling_queue.go
} // NewPodNominator creates a nominator as a backing of framework.PodNominator. // A podLister is passed in so as to check if the pod exists // before adding its nominatedNode info. func NewPodNominator(podLister listersv1.PodLister) framework.PodNominator { return newPodNominator(podLister) } func newPodNominator(podLister listersv1.PodLister) *nominator { return &nominator{ podLister: podLister,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 61.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/common/python/testing.py
def get_size_ratio(path_a: str, path_b: str) -> float: """Return the size ratio of the given paths. Args: path_a: Path of a directory or a file to be the nominator of the ratio. path_b: Path of a directory or a file to be the denominator of the ratio. Returns: Ratio of size of path_a / size of path_b. """ size_a = get_dir_size(path_a) size_b = get_dir_size(path_b)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 21 08:51:46 UTC 2024 - 2.2K bytes - Viewed (0) -
pkg/scheduler/internal/queue/scheduling_queue_test.go
} if len(q.nominator.nominatedPods) != 1 { t.Errorf("Expected nomindatePods to have only 'unschedulablePodInfo': %v", q.nominator.nominatedPods) } if err := q.Delete(unschedulablePodInfo.Pod); err != nil { t.Errorf("delete failed: %v", err) } if len(q.nominator.nominatedPods) != 0 { t.Errorf("Expected nomindatePods to be empty: %v", q.nominator) } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 146.9K bytes - Viewed (0) -
pkg/scheduler/framework/interface.go
if ni == nil { return ModeNoop } return ni.NominatingMode } // PodNominator abstracts operations to maintain nominated Pods. type PodNominator interface { // AddNominatedPod adds the given pod to the nominator or // updates it if it already exists. AddNominatedPod(logger klog.Logger, pod *PodInfo, nominatingInfo *NominatingInfo)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 35.4K bytes - Viewed (0) -
pkg/scheduler/framework/runtime/framework.go
// nominated pods, we run them when those pods are added to PreFilter state and nodeInfo. // If all filters succeed in this pass, we run them again when these // nominated pods are not added. This second pass is necessary because some // filters such as inter-pod affinity may not pass without the nominated pods. // If there are no nominated pods for the node or if the first run of the
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 17 09:07:27 UTC 2024 - 60.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom_test.go
t.Errorf("expected %s as dominator of %s, found %s", d, n, blockNames[domNode]) default: t.Fatal("unexpected dominator condition") } } for id, d := range calcDom { // If nil, we've already verified it if d == nil { continue } for _, b := range fut.blocks { if int(b.ID) == id { t.Errorf("unexpected dominator of %s for %s", blockNames[d], blockNames[b]) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 13.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom.go
// computing both dominator and post-dominator trees. func (f *Func) dominatorsLTOrig(entry *Block, predFn linkedBlocks, succFn linkedBlocks) []*Block { // Adapted directly from the original TOPLAS article's "simple" algorithm maxBlockID := entry.Func.NumBlocks() scratch := f.Cache.allocIDSlice(7 * maxBlockID) defer f.Cache.freeIDSlice(scratch) semi := scratch[0*maxBlockID : 1*maxBlockID]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Dec 03 17:08:51 UTC 2022 - 7.4K bytes - Viewed (0) -
pkg/scheduler/framework/preemption/preemption.go
// priority of the given "pod" and are nominated to run on the given node. // Note: We could possibly check if the nominated lower priority pods still fit // and return those that no longer fit, but that would require lots of // manipulation of NodeInfo and PreFilter state per nominated pod. It may not be // worth the complexity, especially because we generally expect to have a very // small number of nominated pods per node.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 25.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsetree.go
n++ t[b.ID].exit = n // reserve n+1 for exit+1, n+2 is next free number, returned. return n + 2 } // Sibling returns a sibling of x in the dominator tree (i.e., // a node with the same immediate dominator) or nil if there // are no remaining siblings in the arbitrary but repeatable // order chosen. Because the Child-Sibling order is used // to assign entry and exit numbers in the treewalk, those
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl/src/test/kotlin/org/gradle/kotlin/dsl/execution/CombinatorsTest.kt
import org.junit.Test class CombinatorsTest { private val combinator = Combinator(ignoresComments = false, ignoresNewline = false) @Test fun `can recurse`() { var parser by reference<String>() parser = combinator.paren(parser) + combinator.token(IDENTIFIER) { tokenText } assertSuccess(parser("ok"), "ok") assertSuccess(parser("(ok)"), "ok")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Aug 02 08:06:49 UTC 2023 - 7.6K bytes - Viewed (0)