- Sort Score
- Num 10 results
- Language All
Results 51 - 60 of 61 for overkill (0.2 seconds)
-
cmd/erasure-object.go
// // This is possible to be lock free because // - xl.meta for inlined objects has already read the data // into memory, any mutation on xl.meta subsequently is // inconsequential to the overall read operation. // - xl.meta metadata is still verified for quorum under lock() // however writing the response doesn't need to serialize // concurrent writers unlockOnDefer = true
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 24 04:05:31 GMT 2025 - 80.4K bytes - Click Count (0) -
cmd/metrics-v2.go
cacheInterval: 1 * time.Minute, metricsGroupOpts: opts, } mg.RegisterRead(func(_ context.Context) []MetricV2 { ml := []MetricV2{} // metrics pertinent to site replication - overall roll up. if globalSiteReplicationSys.isEnabled() { m, err := globalSiteReplicationSys.getSiteMetrics(GlobalContext) if err != nil { metricsLogIf(GlobalContext, err) return ml }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 133.6K bytes - Click Count (0) -
guava/src/com/google/common/cache/LocalCache.java
} int segmentSize = 1; while (segmentSize < segmentCapacity) { segmentSize <<= 1; } if (evictsBySize()) { // Ensure sum of segment max weights = overall max weights long maxSegmentWeight = maxWeight / segmentCount + 1; long remainder = maxWeight % segmentCount; for (int i = 0; i < this.segments.length; ++i) { if (i == remainder) {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 19:35:11 GMT 2025 - 148.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.21.md
- Overall, enable the feature of `PreferNominatedNode` will improve the performance of scheduling where preemption might frequently happen, but in theory, enable the feature of `PreferNominatedNode`, the pod might not be scheduled to the best candidate node...
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Fri Oct 14 07:03:14 GMT 2022 - 367.3K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.34.md
- The new `dra_resource_claims_in_use` kubelet metrics reported active `ResourceClaims`, overall and by driver. ([#131641](https://github.com/kubernetes/kubernetes/pull/131641), [@pohly](https://github.com/pohly)) [SIG Architecture, Instrumentation, Node and Testing]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Dec 10 01:13:50 GMT 2025 - 333.3K bytes - Click Count (2) -
cmd/site-replication.go
EndpointURL: ep, } return pi, site.DeploymentID == globalDeploymentID() } } return pi, true } // startResync initiates resync of data to peerSite specified. The overall site resync status // is maintained in .minio.sys/buckets/site-replication/resync/<deployment-id.meta>, while collecting // individual bucket resync status in .minio.sys/buckets/<bucket-name>/replication/resync.bin
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 184.8K bytes - Click Count (1) -
CHANGELOG/CHANGELOG-1.30.md
([#123271](https://github.com/kubernetes/kubernetes/pull/123271), [@neolit123](https://github.com/neolit123)) - kubeadm: improved the overall logic, error handling, and output messages when waiting for the kubelet and API server `/healthz` endpoints to return `OK`. The kubelet and API server checks no longer ran in parallel, but one after another (in serial).
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jun 18 18:59:10 GMT 2025 - 398.1K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.28.md
- If all QueueingHintFn return QueueSkip, it puts this pod back to the unschedulable pod pool Having appropriate QueueingHintFn contributes to reducing useless retries and thus improves the overall scheduler's performance. **How can I migrate?** For backward compatibility, nil `QueueingHintFn` is treated as always returning QueueAfterBackoff.
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Fri Sep 05 03:47:18 GMT 2025 - 456.9K bytes - Click Count (1) -
RELEASE.md
* Added `tf.lookup.experimental.MutableHashTable`, which provides a generic mutable hash table implementation. * Compared to `tf.lookup.experimental.DenseHashTable` this offers lower overall memory usage, and a cleaner API. It does not require specifying a `delete_key` and `empty_key` that cannot be inserted into the table.Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
lib/fips140/v1.0.0-c2097c7c.zip
r4 = addMul64(r4, a3, b1) r4 = addMul64(r4, a4, b0) // After the multiplication, we need to reduce (carry) the five coefficients // to obtain a result with limbs that are at most slightly larger than 2⁵¹, // to respect the Element invariant. // // Overall, the reduction works the same as carryPropagate, except with // wider inputs: we take the carry for each coefficient by shifting it right // by 51, and add it to the limb above it. The top carry is multiplied by 19 // according to the reduction identity...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)