This article explains Redis eviction policies, how the eviction process works, and practical solutions for cache penetration, breakdown, and avalanche, helping you select optimal strategies and mitigate high‑traffic cache failures.
This article explains Redis cache eviction policies—including noeviction, allkeys‑lru, volatile‑lru, random, ttl, and lfu—detailing when to use each, how the eviction process works, and practical solutions for cache penetration, breakdown, and avalanche to keep your backend stable under high load.
Explore Redis cache eviction policies, understand how strategies like allkeys‑lru, volatile‑ttl, and noeviction work, and learn practical solutions for cache penetration, breakdown, and avalanche—including Bloom filters, mutex locks, and staggered expirations—to keep your backend resilient under high load.
This article explains Redis eviction policies, how the eviction process works, and practical solutions for cache penetration, breakdown, and avalanche, helping developers choose the right strategy and optimize cache performance under high load.
This article provides a comprehensive guide to backend caching, covering fundamental concepts, usage scenarios, read‑through and cache‑aside strategies, local and distributed cache types, popular services like Redis and Memcached, eviction algorithms such as FIFO, LRU, LFU, and common issues like consistency, avalanche, penetration, and stampede, along with practical mitigation techniques.
This article explores common caching scenarios, selection criteria, and best‑practice pitfalls, demonstrates a Go demo with configurable cache modes, compares byte‑versus‑struct caches, discusses concurrency, expiration, failover, cache transfer, lock contention, memory management, and provides benchmark results to guide high‑performance backend development.
Redis serves as a powerful in‑memory key‑value store for distributed caching, offering various data structures, persistence options, deployment modes, eviction policies, and update strategies, while addressing consistency challenges, cache miss scenarios, and failure modes such as penetration, breakdown, and avalanche.
This article explains Redis's LFU eviction algorithm, its implementation details, code-level mechanics, configuration steps, and how it improves upon LRU by using frequency-based counters and decay to make smarter cache eviction decisions.
This article explains the principles, implementation details, and trade‑offs of Redis’s LRU and LFU cache eviction algorithms, including their data structures, code snippets, configuration parameters, and practical guidance on choosing the appropriate strategy based on workload characteristics.
Redis implements approximate LRU and LFU eviction policies by sampling keys and using a compact 24‑bit field to store timestamps and counters, where LRU evicts the least recently accessed items and LFU evicts those with low, decay‑adjusted access frequency, each with trade‑offs for different workloads.
This article examines the storage bottlenecks in large‑scale AI training, evaluates local‑disk and Alluxio‑based distributed caching strategies, proposes uniform cache eviction and replica‑aware global policies, and introduces the SiloD framework for coordinated compute‑storage scheduling to dramatically improve GPU utilization and overall cluster throughput.
This article explains Redis eviction policies, compares strategies like allkeys‑lru, volatile‑ttl, and noeviction, and provides practical solutions for cache penetration, breakdown, and avalanche to maintain system stability under high concurrency.
This article explains Redis eviction policies such as allkeys‑lru, volatile‑ttl, and others, discusses how the eviction process works, and provides practical solutions for cache penetration, breakdown (stampede), and avalanche, including Bloom filters, mutex locks, and randomized TTLs.
The article analyzes a weekend outage of a Spring Boot microservice where all HTTP requests timed out, tracing the root cause to Caffeine's synchronous cache eviction lock being blocked by a long‑running compute operation, and proposes using AsyncCache with a dedicated thread pool to avoid similar contention.
The article explains the benefits, costs, and various update, penetration, no‑hole, avalanche, and hot‑key optimization techniques for caching in high‑concurrency distributed systems, providing practical guidance on choosing appropriate strategies based on consistency requirements and system load.
This article explains the advantages of Caffeine Cache's W‑TinyLFU algorithm over traditional FIFO, LRU, and LFU policies, details its eviction and reference‑type strategies, and provides step‑by‑step guidance for integrating Caffeine into Spring Boot applications with code examples and configuration tips.
This article explains the high‑performance Caffeine Cache library, its W‑TinyLFU eviction algorithm, various loading and eviction strategies, statistics collection, and how to integrate and configure it in Spring Boot using annotations and programmatic beans.
This article provides an in‑depth overview of caching, covering its definition, when to use it, core concepts, various cache types (client, server, CDN, reverse‑proxy, in‑process, distributed), eviction policies, multi‑level cache architectures, common pitfalls such as cache avalanche, penetration and breakdown, and practical mitigation techniques.
This article explains Redis memory eviction strategies, including volatile and allkeys policies, details the approximate LRU algorithm Redis uses, and provides Java implementations of an LRU cache using LinkedHashMap and a custom doubly‑linked list, complete with code examples and configuration settings.
The article explains why caching is essential for high‑concurrency distributed systems, analyzes its benefits and costs, and then details various cache‑update, penetration‑prevention, bottom‑hole, avalanche, and hot‑key‑rebuild optimization techniques, offering practical guidance for reliable and performant backend architectures.
This article examines the role of caching in high‑concurrency distributed systems, outlining its benefits and costs, various update policies such as LRU/LFU/FIFO, timeout eviction, active refresh, and advanced techniques like cache penetration protection, no‑hole, avalanche, and hot‑key mitigation.
This article explains the role of caching in high‑concurrency distributed systems, detailing its benefits, costs, various update strategies, and advanced optimizations such as penetration protection, bottom‑hole mitigation, avalanche prevention, and hot‑key rebuild handling.
This article explains the benefits, costs, and various update, penetration, bottom‑hole, avalanche, and hot‑key rebuilding strategies for caches in high‑concurrency distributed systems, offering practical guidance on choosing eviction algorithms, using Bloom filters, and improving overall system performance and reliability.
This article explains the benefits, costs, and various update, penetration, hole, avalanche, and hot‑key optimization techniques for caches in high‑concurrency distributed systems, providing practical guidance on choosing appropriate strategies such as LRU/LFU/FIFO, timeout eviction, proactive updates, Bloom filters, and concurrency‑aware batch operations.
The article discusses the importance of caching in high‑concurrency distributed systems, outlining its benefits and costs, various update policies such as LRU/LFU/FIFO, expiration, active refresh, and advanced optimizations like penetration protection, hole mitigation, avalanche prevention, and hot‑key rebuild techniques.
The article explains why caching is essential in high‑concurrency distributed systems, analyzes its benefits and costs, and then details various cache update, penetration, no‑hole, avalanche, and hot‑key rebuilding techniques, offering practical guidance for backend engineers.
This article examines the role of caching in high‑concurrency distributed systems, outlining its performance benefits and associated costs, and detailing various cache‑update strategies—including LRU/LFU/FIFO, expiration, active refresh, Bloom‑filter protection, and solutions for penetration, avalanche, hot‑key rebuild, and the “no‑bottom‑hole” problem.
With hardware costs dropping, many default to Redis for caching, but it isn’t always optimal; this article examines EhCache—a pure‑Java, in‑process cache—covering its architecture, eviction policies, API and XML configurations, and step‑by‑step Spring Boot integration, helping you decide when to prefer it.
Explore comprehensive caching concepts—including client, server, and CDN caches—along with hit rate metrics, eviction methods, popular strategies like FIFO, LRU, LFU, and design patterns such as Cache‑Aside, Read/Write‑Through, and Write‑Behind, plus essential testing considerations for robust application performance.
This article introduces Caffeine Cache as a high‑performance local caching solution that improves on Guava Cache by using the W‑TinyLFU eviction algorithm, explains its core concepts, demonstrates manual, synchronous, and asynchronous loading strategies, details eviction policies, and provides step‑by‑step integration and configuration examples for Spring Boot applications.
Understanding Caffeine Cache in Java involves using its builder for options like expiration, refresh, and weight‑based eviction, recognizing that configuring both expireAfterWrite and expireAfterAccess is redundant, grasping core methods such as isBounded, refreshes, computeIfAbsent, and avoiding common pitfalls like mis‑ordered expiration settings, blocking loaders, cache penetration, and mutable cached objects.
This article explains why technical interviews focus on problem‑solving skills, outlines a four‑step interview approach, introduces the LRU cache eviction policy, analyzes required operations, selects HashMap plus a doubly linked list as the optimal data structures, and provides a complete Java implementation with detailed commentary.
This article explains cache fundamentals—from CPU and local caches to distributed systems—covers design principles, performance‑affecting factors, eviction algorithms, and common high‑concurrency issues such as penetration, stampede, and avalanche, and provides practical solutions for selecting and optimizing cache strategies.
This article traces iQIYI’s five‑stage Java caching journey—from early database lookups, through Redis synchronization, in‑process HashMap and Guava caches, to modern Caffeine with W‑TinyLFU—explaining each phase’s advantages, drawbacks, eviction algorithms, and implementation details such as segment locking, expiration queues, and multi‑queue data structures.
This article explains why cache design is essential for high‑concurrency systems, compares CPU and application caches, outlines multi‑level and distributed caching strategies, discusses write‑through/write‑behind patterns, cache synchronization methods, penetration protection, and eviction policies to alleviate database pressure.
This article explains the motivation behind cache design, compares CPU and application‑level caches, discusses multi‑level and distributed caching, outlines synchronization methods, eviction policies, and answers frequent cache‑related questions to help reduce database load and improve system performance.
This article explains various cache eviction strategies, compares heap, off‑heap, disk and distributed cache types, and provides concrete Java implementations using Guava Cache, EhCache 3.x and MapDB with code examples and usage patterns such as Cache‑Aside and Cache‑As‑SoR.
This article explains Redis's LRU eviction mechanism, starting with a brief LRU overview, presenting a Python LRU cache implementation, then detailing Redis's internal LRU clock, object fields, maxmemory policies, and both active and passive eviction processes, highlighting configuration impacts on performance.
