In the latest update to the SlidingCache<> implementation, we addressed a critical oversight related to concurrent modifications and access patterns. Specifically, we identified that a cache key could be removed during enumeration, triggering a KeyNotFoundException. To address these concerns and enhance the cache's robustness and efficiency, the following adjustments were made:
-
Atomic Locking with Interlocked.CompareExchange: We introduced an atomic lock mechanism using Interlocked.CompareExchange to prevent simultaneous entries into the Cleanup method. This enhancement aims to significantly reduce contention and ensure thread-safe operations within the cache cleanup process.
-
Deferred Cleanup Execution: The CleanupIfNeeded method has been relocated to a finally block following the TryGetValue execution. This will ensure that if PermitExpiredReturns is enabled, there is no race to remove the item while accessing it.
-
Support for Deterministic Element Caching: A new parameter has been added to SlidingCache<>, enabling the caching of expired but deterministic elements. This feature allows expired objects to remain accessible before the Cleanup process has executed, preventing unnecessary removals and recreations. This capability is particularly beneficial for ConstantExpressions and is enabled by default to optimize performance for predictable data patterns.
-
Configurable Expired Returns via CacheConfig: To provide greater control over cache behavior, the PermitExpiredReturns setting has been incorporated into the CacheConfig class. This addition allows developers to manage the allowance of expired item returns based on their specific application requirements and caching strategies.
These enhancements are designed to bolster the SlidingCache<>'s performance, reliability, and flexibility, particularly in high-concurrency environments.
In the latest update to the
SlidingCache<>implementation, we addressed a critical oversight related to concurrent modifications and access patterns. Specifically, we identified that a cache key could be removed during enumeration, triggering aKeyNotFoundException. To address these concerns and enhance the cache's robustness and efficiency, the following adjustments were made:Atomic Locking with
Interlocked.CompareExchange: We introduced an atomic lock mechanism usingInterlocked.CompareExchangeto prevent simultaneous entries into theCleanupmethod. This enhancement aims to significantly reduce contention and ensure thread-safe operations within the cache cleanup process.Deferred Cleanup Execution: The
CleanupIfNeededmethod has been relocated to a finally block following theTryGetValueexecution. This will ensure that ifPermitExpiredReturnsis enabled, there is no race to remove the item while accessing it.Support for Deterministic Element Caching: A new parameter has been added to
SlidingCache<>, enabling the caching of expired but deterministic elements. This feature allows expired objects to remain accessible before the Cleanup process has executed, preventing unnecessary removals and recreations. This capability is particularly beneficial forConstantExpressionsand is enabled by default to optimize performance for predictable data patterns.Configurable Expired Returns via
CacheConfig: To provide greater control over cache behavior, thePermitExpiredReturnssetting has been incorporated into theCacheConfigclass. This addition allows developers to manage the allowance of expired item returns based on their specific application requirements and caching strategies.These enhancements are designed to bolster the
SlidingCache<>'s performance, reliability, and flexibility, particularly in high-concurrency environments.