SkillVaultskills Browse all 1,000+ skills

Data · Version 1.4.0 · Reviewed 2026-08-02

Redis Performance Analyzer

Make data systems more correct and operable for latency spikes and memory and eviction with evidence, explicit trade-offs, and a verification plan.

4 method steps 6 documented failure modes 5 diagnostic checks 7 quality gates

Explains latency spikes, memory growth, eviction behavior, and key-design problems in Redis deployments.

₹199 one-time

Get this skill archive

Install in your AI coding tool

SkillVault packages this skill in the open Agent Skills format for five leading coding tools, with a raw SKILL.md fallback for every other compatible IDE or agent.

See the complete graphical installation and usage guide

What this skill helps you do

  • Latency spikes
  • Memory and eviction
  • Key design review

How Redis Performance Analyzer works

You provide

Read/write ratio, staleness tolerance, and current keys

It inspects

Invalidation path and key completeness for latency spikes

It decides

A memory and eviction design with stampede protection

You verify

System stays correct with the cache disabled entirely

What it checks first

Redis Performance Analyzer explains latency spikes, memory growth, eviction behavior, and key-design problems in Redis deployments. Use it when the work involves Latency spikes, Memory and eviction, Key design review.

  1. Hit rate together with the cost of a miss, because a low hit rate on a cheap computation does not matter.
  2. Whether invalidation is event-driven or purely TTL-based, which decides the maximum staleness.
  3. Key cardinality and value size distribution, since a few large values can dominate memory.
  4. Eviction policy relative to access pattern, and whether evictions are happening at all.
  5. Whether the cache is a performance optimization or has silently become a correctness dependency.

Failure modes it recognizes

  • Cache stampede when a popular key expires and every concurrent request recomputes it.
  • Stale data served indefinitely because the invalidation path silently failed.
  • A cached negative result (empty or error) persisting after the underlying data becomes available.
  • Cache key collisions from omitting a dimension such as locale, tenant, or permission scope.
  • Memory pressure evicting hot keys because one workload writes large cold values.
  • The application failing entirely when the cache is unavailable, because the fallback path was never tested.

Answers it will reject

  • Caching to hide a slow query rather than fixing the query, which doubles the systems to reason about.
  • Using a single global TTL for data with different volatility.
  • Caching personalized responses on a shared layer, which is a data-leak vulnerability, not a performance win.
  • Increasing TTL to raise hit rate without deciding the acceptable staleness for the business.

Decision rules it applies

  • Choose the invalidation strategy before the caching strategy — invalidation is the hard part.
  • Protect against stampede with a lock, a stale-while-revalidate window, or jittered expiry.
  • Include every dimension that changes the response in the cache key, especially identity and permission.
  • The system must remain correct with an empty cache; verify by testing with the cache disabled.

Evidence it asks for

  • Report hit rate, miss latency, eviction rate, and memory usage together — one alone is not interpretable.
  • Load-test with a cold cache to confirm the origin survives a full flush.
  • Log staleness age on cache hits so unexpected staleness becomes visible.

The method inside

  1. Define the measured baseline and user-visible target for latency spikes.
  2. Attribute the dominant cost or latency mechanism affecting memory and eviction.
  3. Rank key design review changes by expected impact, confidence, effort, and regression risk.
  4. Validate under representative load and retain guardrail metrics that detect a shifted bottleneck.

Deliverables

  • Latency spikes assessment
  • Memory and eviction decision and action plan
  • Key design review verification checklist

Evidence requirements

  • Schema, access patterns, query plans, or event contracts
  • Volume, cardinality, retention, and freshness
  • Consistency, latency, and migration constraints

Quality gates

  • Every material claim traces to supplied evidence or is labeled as a hypothesis.
  • The response follows the declared deliverable contract.
  • No execution, access, measurement, or verification is invented.
  • Secrets and personal data are redacted rather than repeated.
  • The user receives a concrete independent verification step.
  • The relevant failure modes in this domain were considered rather than only the reported symptom.
  • No listed anti-pattern was recommended as a solution.

Example task

Input

Redis latency spikes every few minutes and memory keeps climbing. Here is INFO output.

Expected output

The spikes align with keyspace expiration cycles and a large hash being scanned. Two things are compounding: an unbounded collection and a blocking command...

Boundaries and compatibility

Ideal for

  • Latency spikes: produce a decision or artifact grounded in supplied evidence.
  • Memory and eviction: produce a decision or artifact grounded in supplied evidence.
  • Key design review: produce a decision or artifact grounded in supplied evidence.

Out of scope

  • Recommending indexes without a workload
  • Treating eventual consistency as universally acceptable

Agent compatibility

  • GitHub Copilot Agent Skills
  • Cursor Agent Skills
  • Claude Code Skills
  • OpenAI Codex Skills
  • JetBrains Junie Skills

Tool policy: Advisory by default. No tools are assumed. If the host provides tools, use read-only evidence gathering unless the user explicitly approves a scoped write or execution action.