- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 47 for scoreRes (0.19 sec)
-
pkg/scheduler/framework/plugins/tainttoleration/taint_toleration.go
} // NormalizeScore invoked after scoring all nodes. func (pl *TaintToleration) NormalizeScore(ctx context.Context, _ *framework.CycleState, pod *v1.Pod, scores framework.NodeScoreList) *framework.Status { return helper.DefaultNormalizeScore(framework.MaxNodeScore, true, scores) } // ScoreExtensions of the Score plugin. func (pl *TaintToleration) ScoreExtensions() framework.ScoreExtensions { return pl }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 9.2K bytes - Viewed (0) -
pkg/kubelet/qos/policy.go
// The OOM score of a process is the percentage of memory it consumes // multiplied by 10 (barring exceptional cases) + a configurable quantity which is between -1000 // and 1000. Containers with higher OOM scores are killed if the system runs out of memory. // See https://lwn.net/Articles/391222/ for more information. func GetContainerOOMScoreAdjust(pod *v1.Pod, container *v1.Container, memoryCapacity int64) int {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 10 14:49:26 UTC 2023 - 3.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/score/ScoreBooster.java
if (bulkRequestBuilder != null) { final BulkResponse response = bulkRequestBuilder.execute().actionGet(requestTimeout); if (response.hasFailures()) { logger.warn("Failed to update scores: {}", response.buildFailureMessage()); } bulkRequestBuilder = null; } } public int getPriority() { return this.priority; }
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 5K bytes - Viewed (0) -
src/cmd/compile/internal/inline/inlheur/scoring.go
returnFeedsInlinableFuncToIndCallAdj returnFeedsConcreteToInterfaceCallAdj sentinelScoreAdj // sentinel; not a real adjustment ) // This table records the specific values we use to adjust call // site scores in a given scenario. // NOTE: these numbers are chosen very arbitrarily; ideally // we will go through some sort of turning process to decide // what value for each one produces the best performance.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:42:52 UTC 2024 - 24.2K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/nodeaffinity/node_affinity.go
} // NormalizeScore invoked after scoring all nodes. func (pl *NodeAffinity) NormalizeScore(ctx context.Context, state *framework.CycleState, pod *v1.Pod, scores framework.NodeScoreList) *framework.Status { return helper.DefaultNormalizeScore(framework.MaxNodeScore, false, scores) } // ScoreExtensions of the Score plugin. func (pl *NodeAffinity) ScoreExtensions() framework.ScoreExtensions { return pl }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Dec 18 12:00:10 UTC 2023 - 12.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/language/doc.go
// two different tags may represent the same language. // // By default, only legacy and deprecated tags are converted into their // canonical equivalent. All other information is preserved. This approach makes // the confidence scores more accurate and allows matchers to distinguish // between variants that are otherwise lost. // // As a consequence, two tags that should be treated as identical according to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 4.2K bytes - Viewed (0) -
pkg/scheduler/apis/config/types_pluginargs.go
// Each point contains utilization (ranges from 0 to 100) and its // associated score (ranges from 0 to 10). You can turn the priority by // specifying different scores for different utilization numbers. // The default shape points are: // 1) 0 for 0 utilization // 2) 10 for 100 utilization // All points must be sorted in increasing order by utilization.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jan 13 23:15:53 UTC 2023 - 8.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
return x } func (h ValHeap) Less(i, j int) bool { x := h.a[i] y := h.a[j] sx := h.score[x.ID] sy := h.score[y.ID] if c := sx - sy; c != 0 { return c < 0 // lower scores come earlier. } // Note: only scores are required for correct scheduling. // Everything else is just heuristics. ix := h.inBlockUses[x.ID] iy := h.inBlockUses[y.ID] if ix != iy {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
tensorflow/cc/saved_model/testdata/half_plus_two_pbtxt/00000123/saved_model.pbtxt
dim { size: -1 } dim { size: 1 } } } } outputs { key: "scores" value { name: "y3:0" dtype: DT_FLOAT tensor_shape { dim { size: -1 } dim { size: 1
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 26 01:10:27 UTC 2017 - 46.9K bytes - Viewed (0) -
src/go/doc/comment/text.go
// it makes the text easier to skim if not too many sentences // or phrases begin with a single word on the previous line. // A score is the score (also called weight) for a given line. // add and cmp add and compare scores. type score struct { hi int64 lo int64 } add := func(s, t score) score { return score{s.hi + t.hi, s.lo + t.lo} } cmp := func(s, t score) int { switch { case s.hi < t.hi: return -1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 8.8K bytes - Viewed (0)