- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 240 for contention (0.15 sec)
-
android/guava/src/com/google/common/cache/LongAdder.java
* sum that is used for purposes such as collecting statistics, not for fine-grained synchronization * control. Under low update contention, the two classes have similar characteristics. But under * high contention, expected throughput of this class is significantly higher, at the expense of * higher space consumption. * * <p>This class extends {@link Number}, but does not define methods such as {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 5.6K bytes - Viewed (0) -
src/test/java/jcifs/smb/CriticalPerformanceTest.java
assertEquals(threadCount * operationsPerThread, successCount.get()); assertTrue(overallTimeMs < 1000, "Operations should complete quickly without lock contention"); pool.close(); } /** * Test buffer cache performance with concurrent operations */ @Test public void testBufferCachePerformance() throws Exception {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 15.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
/** * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The * table is internally partitioned to try to permit the indicated number of concurrent updates * without contention. Because assignment of entries to these partitions is not necessarily * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 12.8K bytes - Viewed (0) -
docs/smb3-features/01-smb3-lease-design.md
- Lease entries should be evicted based on LRU when max leases reached - Implement periodic cleanup of expired leases ### 9.2 Thread Safety - Use concurrent data structures for lease storage - Minimize lock contention in hot paths - Async handling of lease breaks ### 9.3 Network Efficiency - Batch lease requests when possible - Implement lease key reuse for related files - Optimize lease break acknowledgment timing
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 22K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheBuilder.java
/** * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The * table is internally partitioned to try to permit the indicated number of concurrent updates * without contention. Because assignment of entries to these partitions is not necessarily * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 51.7K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/Striped.java
* <i>stripes</i>, increasing the granularity of a single lock and allowing independent operations * to lock different stripes and proceed concurrently, instead of creating contention for a single * lock. * * <p>The guarantee provided by this class is that equal keys lead to the same lock (or semaphore), * i.e. {@code if (key1.equals(key2))} then {@code striped.get(key1) == striped.get(key2)} (assuming
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java
currentWaiter.unpark(); } } // Gets and Timed Gets // // * Be responsive to interruption // * Don't create Waiter nodes if you aren't going to park, this helps reduce contention on // waitersField. // * Future completion is defined by when #valueField becomes non-null/non DelegatingToFuture // * Future completion can be observed if the waitersField field contains a TOMBSTONE
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.2K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFutureState.java
currentWaiter.unpark(); } } // Gets and Timed Gets // // * Be responsive to interruption // * Don't create Waiter nodes if you aren't going to park, this helps reduce contention on // waitersField. // * Future completion is defined by when #valueField becomes non-null/non DelegatingToFuture // * Future completion can be observed if the waitersField field contains a TOMBSTONE
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 34.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* of reads may not be immediately reflected on the algorithm's data structures. These structures * are guarded by a lock and operations are applied in batches to avoid lock contention. The * penalty of applying the batches is spread across threads so that the amortized cost is slightly * higher than performing just the operation without enforcing the capacity constraint. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 90K bytes - Viewed (0) -
docs/en/docs/deployment/versions.md
## About versions { #about-versions } Following the Semantic Versioning conventions, any version below `1.0.0` could potentially add breaking changes. FastAPI also follows the convention that any "PATCH" version change is for bug fixes and non-breaking changes. /// tip The "PATCH" is the last number, for example, in `0.2.3`, the PATCH version is `3`.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 3.5K bytes - Viewed (0)