Capacity Watermark
A memory gauge fills to the eviction watermark, registers the touch and is cut back by a reclaim step below the rule.
A memory gauge fills to the eviction watermark, registers the touch and is cut back by a reclaim step below the rule.
A scrolling strip chart of dirty-page depth accumulates toward the flush threshold and is cut back to the floor at each flush.
A purge issued at the origin propagates outward through two rings of edge nodes, dropping each ring as the wave arrives.
Four expiry ticks stacked on one instant of a timeline spread apart under jitter so the keys no longer expire together.
A single ratio rule splits into hit and miss segments that trade share across the boundary without a seam as the hit rate recovers.
Three namespace field chips slide together into one composed cache key and the digest cells beneath resolve left to right.
A bimodal latency histogram shifts weight from the slow origin hump into the fast hit columns as the cache fills.
A recency ladder of five entries steps down one rung on each access, the least recent leaves past the eviction rule and a fresh entry arrives at the top.
A freshness band runs out into a stale tail that keeps serving while a replacement window is redrawn beneath the timeline.
Five concurrent misses converge on one gate; a single request is admitted to the origin while the rest park behind the lock rule.
A twelve-cell keyspace matrix holds warm entries until a tag sweep crosses it and each column empties behind the rule.
A probe descends three lookup tiers, missing L1 and L2, and the value returns from the origin rung to populate L1.
A circular time-to-live dial unwinds its remaining arc to the expiry tick, where the key cell at the hub goes cold before a fresh lifetime is set.
A hit-ratio curve is plotted on axes from a cold start, rising to settle against the steady-state rule where the head marker lands.
A write descends through the cache band into the durable store band, acknowledging a value cell in each row as it passes.