Observability
RED and USE: two checklists, one triage discipline
The pager fires. p99 latency on the checkout service spiked from 80 ms to 1.2 s. You have seconds to find the right dashboard before the incident commander is asking for updates. The wrong move is opening every panel. The right move is two short checklists.
What RED is
Tom Wilkie introduced RED at a London Prometheus meetup in 2015. RED describes a service from the caller’s perspective:
- Rate — requests per second arriving at the service.
- Errors — failed requests per second (HTTP 5xx, gRPC non-OK, timeouts).
- Duration — the latency distribution (p50 / p95 / p99) of the requests that did complete.
If RED looks sick, the user is sick. Rate tells you whether traffic is normal. Errors tell you whether requests are failing. Duration tells you whether surviving requests are slow.
What USE is
Brendan Gregg named USE in 2012 as an emergency checklist for performance debugging. USE describes every resource (CPU, memory, disk, network, locks, thread pools) from three angles:
- Utilization — average percentage of time the resource was busy.
- Saturation — amount of queued work the resource cannot service yet (run-queue length, wait time).
- Errors — count of error events on the resource (ECC errors, disk EIO, NIC CRC, ENOSPC).
If USE looks sick on a box, that resource is a candidate cause for the RED symptom.
The layered mental model
| Method | What it measures | Answers | Origin |
|---|---|---|---|
| RED | Services (request-driven) | Is the user unhappy? Which symptom? | Tom Wilkie, 2015 |
| USE | Resources (CPU, memory, disk, …) | Which resource caused it? | Brendan Gregg, 2012 |
The reading rhythm during an incident is always RED first, USE second:
- Open the RED dashboard for the affected service.
- Identify which of R / E / D is abnormal — that names the symptom.
- Switch to the USE dashboard for the resources under that service.
- Find the resource where utilization or saturation jumped — that names the candidate cause.
- Drill into traces, logs, or profiling only after RED and USE have narrowed the search space.
The hospital metaphor
Think of a hospital. RED is the patient’s vital signs — pulse, blood pressure, temperature — measured from the outside. USE is the ICU monitoring of each life-support machine — oxygen flow, pump pressure, error LEDs — measured at the equipment itself. You need both. If the patient’s vitals crash you act fast, but to know why you walk over and check the machines. Doctors who watch only one side miss obvious problems.
A concrete triage
On-call engineer Bea gets paged: p99 latency on the checkout service spiked from 80 ms to 1.2 s. The RED dashboard shows Rate steady at 400 req/s, Errors under 0.1%, Duration p99 15× worse. That is the RED triage — requests still arrive and mostly succeed, but they are slow. Bea switches to USE on the boxes: CPU at 92%, run queue jumped from 0 to 14. The boxes are CPU-saturated; threads queue for cycles. Fix: scale out. Diagnosis took under a minute.
Why this works
USE’s Saturation is the most diagnostic signal of the three. Utilization tells you how busy a resource was on average — a CPU at 100% utilization is fine if no work is waiting (it is just keeping pace). What matters is the run-queue length. A disk at 80% utilization with queue depth 50 is far worse than a disk at 95% utilization with queue depth 1, because the queue depth is the leading indicator of latency: every job in line pays the queueing delay.
A monitoring dashboard shows the service Rate, Errors, and Duration. Which methodology is this?
USE method says: for every resource, check Utilization, Saturation, and Errors. What does 'saturation' mean in USE?
Fill in the blank: RED is the methodology for measuring _______, while USE is the methodology for measuring resources.
Order the steps of a typical RED+USE incident response:
- 1 Pager fires — a symptom is reported (latency, errors, capacity)
- 2 Open the RED dashboard for the affected service
- 3 Identify which of R / E / D is abnormal — that names the symptom
- 4 Switch to the USE dashboard for the resources under that service
- 5 Find the resource where utilization or saturation jumped — that names the cause
- 6 Drill into traces, logs, or profiling only after RED and USE have narrowed scope
- 7 Apply the fix (scale up, restart, throttle, rollback) and watch RED return to baseline
- 01In two sentences, why is running RED alone or USE alone usually not enough for incident response?
- 02What are the three letters of USE and what does each measure?
- 03Who introduced RED and when? Who introduced USE and when?
RED and USE are two short checklists written two years apart that together cover both the service the user touches and the resources that service stands on. RED (Rate, Errors, Duration) measures request flow from the caller’s perspective — if RED looks sick, the user is sick. USE (Utilization, Saturation, Errors) measures every physical and logical resource from three angles — if USE looks sick on a box, that is a candidate cause. The senior engineer’s reflex on any incident is RED first (name the symptom), USE second (find the cause), and everything else — logs, traces, profiles — only after those two checklists have narrowed the space. Saturation, not utilization, is the most diagnostic dimension of USE: a queue of waiting work is the leading indicator of user-visible latency even when average utilization is moderate.
- Instrumenting RED in Prometheus: counters, histograms, and cardinality disciplinemiddle
- USE on Linux: CPU, memory, disk, network, and PSImiddle
- Golden signals, dashboard layout, and service mesh auto-REDmiddle
- Cardinality as a cost driver: labels, PII, exemplars, and samplingmiddle
- Native histograms, SLO tie-in, and production failure patternsmiddle
appears again in167
- The journey of a request: seven stops from socket to responsejunior
- Accept and parse: from kernel queue to a typed requestmiddle
- Routing and middleware: choosing what runs, and in what ordermiddle
- Handler and response: from business logic to bytes on the wiremiddle
- Streaming and backpressure: when the client reads slower than you writesenior
- Timeouts and tail latency: budgets, deadlines, and the fan-out trapsenior
- Middleware and DI: the two patterns that shape every backendjunior
- Writing middleware: signatures, next(), and the three framework modelsmiddle
- Inversion of control: how dependencies reach a classmiddle
- DI scopes and lifecycles: singleton, request, transientmiddle
- DI as a testing seam: fakes, mocks, and the boundary that matterssenior
- DI containers in production: resolution graphs, circular deps, and when not tosenior
- Blocking vs non-blocking I/O: two ways to waitjunior
- The event loop: one thread, ordered phasesmiddle
- What blocks the loop: CPU work and sync callsmiddle
- Offloading CPU work: worker threads and the libuv poolmiddle
- Backpressure and bounded concurrencysenior
- Throughput under load: tail latency and saturationsenior
- Why pool: the cost of creating a connectionjunior
- Pool sizing: why bigger is not fastermiddle
- Acquisition and timeouts: the wait queue is the real latency dialmiddle
- Retry strategies: backoff, jitter, and thundering herdmiddle
- Observability, production failures, and global-scale designsenior
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Node.js event loop: phases, nextTick, and loop lagsenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- LCP: four phases, one dominant costmiddle
- INP: input delay, processing, presentationmiddle
- Lab vs field: why the two disagree and how to use eachmiddle
- Metric tradeoffs, RUM attribution, and the CI+field loopsenior
- The full picture: URL to LCP to INP as a relay racejunior
- Eight layers traced: from the service worker to the second navigationmiddle
- Five canonical breaks: where production reliably diessenior
- The three-track method: reading traces and building a monitored systemsenior
- What an index is and how it speeds up queriesjunior
- The leading-column rule and composite index designmiddle
- Partial, expression, and covering indexesmiddle
- Index types: GIN, GiST, BRIN, Hash, Bloom, and HOT updatesmiddle
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- Index design exercise: full-text search strategysenior
- EXPLAIN and execution plans: what the planner decides and whyjunior
- Scan types: Seq, Index, Bitmap, Index-Onlymiddle
- Join algorithms and the row-estimate cascademiddle
- pg_statistic, ANALYZE, and production observabilitymiddle
- Extended statistics: fixing correlated-column estimate failuressenior
- Plan cache, cost-constant tuning, and planner internalssenior
- Production failure modes and plan stabilitysenior
- Connection pools: amortising the cost of a Postgres backendjunior
- PgBouncer session, transaction, and statement modesmiddle
- Pool sizing: the (cores × 2) + spindles formula and the two-layer stackmiddle
- Pool exhaustion and idle-in-transaction: the 3 AM failure modemiddle
- Migrating to transaction mode: rollout playbook and PgBouncer 1.21 prepared statementsmiddle
- The Postgres process model and why raising max_connections degrades throughputsenior
- Pooler landscape 2026, serverless connection storms, and the full failure-mode taxonomysenior
- ADD COLUMN: instant in PG 11+ vs rewrite in older Postgresjunior
- The lock-queue failure mode: why instant DDL can freeze the databasemiddle
- Safe DDL patterns: NOT VALID, CONCURRENTLY, and unsafe-op fixesmiddle
- Migration failure taxonomy and production disciplinesenior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Online resharding, 2PC, and the operational cost of shardingsenior
- The seven acts: from CREATE TABLE to Citusjunior
- Acts 1–3 in depth: schema, indexes, and planner statisticsmiddle
- Acts 4–6 in depth: MVCC bloat, connection pooling, and safe migrationsmiddle
- Act 7 in depth: sharding, co-location, and the seven-tier tradeoff cascademiddle
- Observability, anti-patterns, and production triagesenior
- Bits on the wirejunior
- Latency mathmiddle
- Bufferbloat and congestionsenior
- The physical frontiersenior
- Sequence numbers and connection statemiddle
- Flow control and congestion controlmiddle
- BBR, production observability, and beyond TCPsenior
- CDN: putting content next doorjunior
- Anycast and GeoDNS: routing to the nearest edgemiddle
- Tiered cache and Cache-Controlmiddle
- Vary header and cache keysmiddle
- Stale-while-revalidate and cache stampedesenior
- Edge workers and edge-side compositionsenior
- CDN operations and observabilitysenior
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket vs SSE vs long-polling: choosing the right transportmiddle
- WebSocket backpressure: when clients can''''t keep upmiddle
- Reconnection: jittered backoff, thundering herd, message resumptionsenior
- WebSocket at scale: HTTP/2 multiplexing, permessage-deflate, C10Msenior
- WebSocket in production: proxies, security, and distributed architecturesenior
- What reverse proxies dojunior
- Balancing algorithms: round-robin to power-of-two-choicesmiddle
- L4 vs L7 load balancing and client-IP preservationmiddle
- Health checks, connection draining, and slow startmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- QUIC streams and head-of-line blockingjunior
- Integrated handshake and 1-RTTmiddle
- Connection IDs and network migrationmiddle
- Loss detection and congestion controlmiddle
- 0-RTT resumption and packet encryptionsenior
- Deployment tradeoffs and CPU costsenior
- DDoS: what it is and why it worksjunior
- Amplification attacks and state exhaustionmiddle
- Rate limiting: algorithms and architecturemiddle
- WAFs, firewalls, mTLS, and HSTSmiddle
- DNS cache poisoning and BGP hijackingsenior
- Defense-in-depth architecture and attack economicssenior
- The twelve layers: one URL, seven actorsjunior
- DNS, TCP, TLS in sequence: where the milliseconds gomiddle
- Critical render path and Core Web Vitalsmiddle
- Proxy intercepts and security gates: rate limiters, WAF, mTLSmiddle
- Alternate paths: QUIC 0-RTT, WebSocket upgrade, connection migrationmiddle
- Observability: distributed traces, USE/RED, and samplingsenior
- Resilience: cascading retries, circuit breakers, and error budgetssenior
- Why profile first: measure where time actually goesjunior
- Amdahl''''s law and self-time: the ceiling on every speedup you can shipmiddle
- The measurement loop: microbench, macrobench, prod profile, observer effectmiddle
- Reading flame graphs: shapes, per-language profilers, and the 60-second scanmiddle
- Statistical baselines: why one run is not a measurementmiddle
- Profiler history and microbenchmark pitfalls: Knuth to GWPsenior
- Hardware counters, cold-start profiles, and profile securitysenior
- Continuous profiling at scale: costs, CI gates, trace correlation, and anti-patternssenior
- What makes a hot path: symptom vs causejunior
- Five shapes of hotspot: CPU, alloc, cache, lock, syscallmiddle
- Reading parent and child chains: where to apply the fixmiddle
- JIT deopt, the fix-and-verify loop, and PR-time profilingmiddle
- Hardware counters and Intel TMA: sub-category diagnosissenior
- False sharing and native-bridge hot pathssenior
- Hot paths in production: security, tail latency, and tooling lineagesenior
- Memory hierarchy: why the same O(N) loop can be 17x slowerjunior
- Row-major vs column-major: access order and the 9x gapjunior
- Branch prediction and branchless codemiddle
- Hardware prefetcher, TLB, and memory-level parallelismsenior
- GC basics: what the runtime taxes you forjunior
- GC algorithms: generational, concurrent, and per-runtimemiddle
- GC tradeoffs: pause, throughput, heap — and object poolingmiddle
- GC tuning: pacing, heap shape, and allocation observabilitymiddle
- GC internals: tri-color invariant, write barriers, and per-runtime deep-divessenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- N+1: one logical operation, many round-tripsjunior
- Fix families: JOIN, IN, preload, and DataLoadermiddle
- Detecting N+1: query logs, APM traces, and CI gatesmiddle
- DataLoader: batching across resolver treesmiddle
- Cross-protocol N+1: HTTP fan-out and Redis MGETmiddle
- N+1 at scale: pool exhaustion, plan changes, and denormalisationsenior
- Batching: amortize fixed cost per operationjunior
- The batching window: size and wait timemiddle
- Batching in Kafka and Postgresmiddle
- io_uring and observability of batchingmiddle
- From Nagle to io_uring: evolution of batchingmiddle
- Backpressure, failure isolation, and batch security in productionsenior
- What a bundle actually costs: download, parse, compile, executejunior
- Core Web Vitals: LCP, INP, and CLSmiddle
- Code splitting: route-level, component-level, vendor splittingmiddle
- Tree shaking and compression: removing what you don''''t usemiddle
- Third-party scripts: the silent budget killermiddle
- CI enforcement and RUM: making budgets stickmiddle
- V8 JIT pipeline, HTTP priorities, and bundle securitysenior
- The performance loop: discipline, not a projectjunior
- Classify and fix: matching bottleneck families to remediesmiddle
- Observability stack and CI gates: catching regressions before they shipmiddle
- Incident to enforcement: SLO burn to verified fix in 35 minutesmiddle
- Culture, economics, and org-scale performancesenior