- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for stabilize (2.66 sec)
-
pkg/controller/podautoscaler/horizontal.go
} if rec.timestamp.Before(upCutoff) && rec.timestamp.Before(downCutoff) { foundOldSample = true oldSampleIndex = i } } // Bring the recommendation to within the upper and lower limits (stabilize). recommendation := args.CurrentReplicas if recommendation < upRecommendation { recommendation = upRecommendation } if recommendation > downRecommendation { recommendation = downRecommendation
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 63.6K bytes - Viewed (0) -
cluster/gce/windows/k8s-node-setup.psm1
& sc.exe failure kubelet reset= 0 actions= restart/10000 Log-Output "Starting kubelet service" & sc.exe start kubelet Log-Output "Waiting 10 seconds for kubelet to stabilize" Start-Sleep 10 Write-VerboseServiceInfoToConsole -Service 'kubelet' if (Get-Process | Where-Object Name -eq "kube-proxy") { Log-Output -Fatal `
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jun 07 21:13:22 UTC 2024 - 88.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
var desired desiredState // Instead of iterating over f.Blocks, iterate over their postordering. // Liveness information flows backward, so starting at the end // increases the probability that we will stabilize quickly. // TODO: Do a better job yet. Here's one possibility: // Calculate the dominator tree and locate all strongly connected components. // If a value is live in one block of an SCC, it is live in all.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
staging/src/k8s.io/api/apps/v1/types.go
// the DaemonSet and StatefulSet controllers for update and rollback, this object is beta. However, // it may be subject to name and representation changes in future releases, and clients should not // depend on its stability. It is primarily for internal use by controllers. type ControllerRevision struct { metav1.TypeMeta `json:",inline"` // Standard object's metadata.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 23 17:42:49 UTC 2024 - 49.1K bytes - Viewed (0) -
staging/src/k8s.io/api/apps/v1beta2/types.go
// the DaemonSet and StatefulSet controllers for update and rollback, this object is beta. However, // it may be subject to name and representation changes in future releases, and clients should not // depend on its stability. It is primarily for internal use by controllers. type ControllerRevision struct { metav1.TypeMeta `json:",inline"` // Standard object's metadata.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Nov 27 20:06:24 UTC 2023 - 52.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/lower_tf.cc
// Exponential of input values and then their sum can be very large here. // Division with large denominator is numerically unstable. To improve // numerical stability, subtract each batch with their max element so that // the maximum input value is zero. It can be shown that softmax computed // after adding or subtracting all inputs in a batch using a common value
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 74.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* empty at any point. (The sum ensures accuracy up through at least 1<<31 per-segment * modifications before recheck.) Method containsValue() uses similar constructions for * stability checks. */ long sum = 0L; Segment<K, V, E, S>[] segments = this.segments; for (int i = 0; i < segments.length; ++i) { if (segments[i].count != 0) { return false; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* empty at any point. (The sum ensures accuracy up through at least 1<<31 per-segment * modifications before recheck.) Method containsValue() uses similar constructions for * stability checks. */ long sum = 0L; Segment<K, V, E, S>[] segments = this.segments; for (int i = 0; i < segments.length; ++i) { if (segments[i].count != 0) { return false; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
ld.buildStacks() changed, err := ld.updateRequirements(ctx) if err != nil { ld.error(err) break } if changed { // Don't resolve missing imports until the module graph has stabilized. // If the roots are still changing, they may turn out to specify a // requirement on the missing package(s), and we would rather use a // version specified by a new root than add a new dependency on an
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
src/cmd/compile/internal/types2/api_test.go
t.Fatal(err) } imports[pkg.Name()] = pkg return pkg } makePkg(lib) pkg := makePkg(test.src) t.Run(pkg.Name(), func(t *testing.T) { // Sort instances in source order for stability. instances := sortedInstances(instMap) if got, want := len(instances), len(test.instances); got != want { t.Fatalf("got %d instances, want %d", got, want) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 20:08:23 UTC 2024 - 93.3K bytes - Viewed (0)