ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Databases & messaging · #memcached
Learn how to choose Memcached chunk size and growth factor to avoid premature evictions, reduce internal fragmentation, and validate slab health with stats slabs.
Memcached’s CAS token lets clients detect concurrent changes and safely retry read‑modify‑write updates without server‑side locking.
When scaling Memcached, the classic modulo hashing approach can cause massive cache misses. Consistent hashing, combined with virtual nodes, keeps most keys on their original servers, preserving hit rates. Learn how to implement it and what trade‑offs to watch for.
Learn how to implement Memcached as a distributed caching layer to reduce database load using the cache-aside pattern and consistent hashing.
Learn how Memcached's compare-and-swap (CAS) operation lets you safely update shared counters without lost updates, and see the trade‑offs involved.
Learn how to design a low‑latency, fault‑tolerant cache using Memcached’s client‑side consistent hashing. The guide covers minimal architecture, trust boundaries, operational checks, failure modes, and when to rethink the design.
Securing a Memcached deployment against unauthorized public access typically involves a choice between infrastructure-level network isolation and application-level authentication. By default, Memcached listens on port 11211 without built-in credentials, making it vulnerable to data leakage if exposed to the public internet. Network isolation via VPC subnets
The memcached server writes an "Out of memory" entry when its allocation path cannot secure memory for an incoming item. The goal is to determine what this documented failure condition reveals about a deployment before any configuration is changed. The uncertainty lies in interpretation. Memcached reclaims space through per-slab-class LRU eviction rather tha
Memcached manages item expiration using a 32-bit unsigned integer. The system distinguishes between a relative offset and an absolute timestamp based on a specific threshold: values under 2,592,000 seconds (30 days) are treated as relative TTLs, while values exceeding this limit are interpreted as Unix epoch timestamps. When migrating data structures or adju