Performance
Continuous profiling at scale: costs, CI gates, trace correlation, and anti-patterns
An SLO burn alert fires. In 2020, the on-call opens a terminal, runs a manual profile capture, waits 60 seconds, and stares at a flame graph that may or may not represent the traffic causing the burn. In 2026, they click the alert, click the slow trace, click the span — and the flame graph filtered to that exact trace-id is already there.
Continuous profiling: costs and tradeoffs
Always-on profiling at 2-5% overhead is the modern default. The cost is non-zero and compounds across a fleet.
CPU overhead: 200-service fleet at 100 Hz, 2% overhead = the equivalent of running ~4 extra services worth of CPU permanently.
Storage overhead: 30-second profiles at ~200 KB compressed × 240 per hour × 24 hours × 200 services ≈ 230 GB/day raw. Pyroscope 2.0’s symbol deduplication cuts this 3x. Tiered retention (7 days fine, 30 days downsampled, 90 days summary) cuts another 5x in aggregate. Net cost on object storage: ~$25-100/month for 200 services.
The rollout pattern: pay the cost only when the team has the discipline to use the data. A small team starting out may get more value from on-demand profiling (perf record, pprof endpoint) and adopt continuous profiling later. The graduation criterion: reaching-for-the-profile is already a reflex. If the team has to remember to look, continuous profiling becomes decoration.
Profile-trace correlation
The integrated triage workflow:
SLO burn alert → click → traces filtered to the burn window → pick a slow trace → click span → profile filtered to that span’s trace-id → flame graph for the specific request.
Sub-30-second drill from page-out to git blame.
The bridge: trace-id stamping inside profile samples. Each stack sample carries the active trace-id at the moment of sampling. At query time the backend joins profile samples to the trace. OpenTelemetry’s profile signal (beta as of 2026) standardises this stamping.
Production implementations:
- Grafana Tempo + Pyroscope
- Datadog APM + Continuous Profiler
- Honeycomb + OTel profile signal
Without trace-id stamping, the on-call must guess which profile sample corresponds to the slow request. With it, the answer is one filter away.
| Triage step | Without trace-profile join | With trace-profile join |
|---|---|---|
| Find the slow span | Trace view, ~30s | Trace view, ~30s |
| Get the flame graph for that request | Manual capture, 2-5 minutes | Click the span, <5 seconds |
| Total drill to function | 3-10 minutes | Under 30 seconds |
Profile-driven CI gates
Continuous profiling enables pre-merge regression detection.
Pattern: every PR triggers a canary deploy. A 5-minute load test under representative traffic captures a CPU profile and an allocation profile. The CI job diffs against main’s baseline. If any function’s CPU share grows by more than a configured threshold (typically 10% absolute or 30% relative), the PR is flagged for review.
Implementations: Pyroscope’s compare API, Datadog’s deploy comparison, custom pipelines using Go’s pprof diff or async-profiler’s JFR diff.
Payoff: regressions that would have hit production at p99 are caught in CI. Mean time to detect on perf regressions drops from days (production monitoring eventually flags) to minutes (CI fails the PR).
Operational challenges: (1) Noisy baselines — main itself is changing; refresh the baseline weekly, not nightly. (2) Variance thresholds — start loose (≥30% absolute) and tighten over months. (3) Synthetic load mismatch — extend the load profile based on missed regressions caught in production. (4) Engineer pushback — provide a /perf-override escape hatch requiring manager sign-off and logged for audit.
Production failures: profile-first paid off
Stripe (2021): service at 80% CPU. Team guessed retries. Profile showed 60% of CPU in a JSON parser called on every health-check 100 times/second. Fix: cache the parsed config. CPU dropped to 30% in 8 minutes.
GitHub (2020): Ruby workers OOMing. Allocation profile pointed at template-rendering allocating 200 MB per request.
Discord (2020): chat tail latency. JSON serialisation switch dropped p99 tail.
Counter-example (2019 startup): two months rewriting a Postgres query for a “slow” admin page. Profile finally showed 90% in a third-party widget. SQL change moved nothing.
Pattern: with the profile, the bottleneck is named in minutes. Without it, teams burn weeks on the wrong code.
Anti-patterns
Five common anti-patterns in performance work:
- Optimising the cold path — a function called once at startup gets a 100x rewrite while the per-request hot path is ignored. Catch: “calls per second × per-call cost”, not just per-call cost.
- Microbench-driven optimisation — function X is 10x faster in isolation; production is 1.03x. Catch: production profile share before any microbench rewrite.
- “We cannot profile production, it is too expensive” — an excuse to skip the only honest measurement. Catch: continuous profiling overhead is 2-5%, well below the gain from finding any real bottleneck.
- Single-run reporting — “this PR is 12% faster” with one measurement. Catch: insist on distributions.
- Regression-by-feature-flag — a perf improvement is gated behind a flag and never enabled. Catch: the CI profile gate must test flag-enabled runs; otherwise the improvement is permanent dead code.
Diagnose a profile-vs-production-metric disagreement
# Production metrics (5-minute window)
checkout_p99_ms 580
checkout_p99_ms_prev 820 # before deploy
cpu_pct 62
cpu_pct_prev 58
# go tool pprof -diff_base baseline.cpu prod.cpu
File: checkout
Type: cpu
Showing nodes accounting for -3.20s, 1.15% of -278.5s total
flat flat% sum% cum cum%
-1.80s 0.64% 0.64% -1.80s 0.64% net/http.(*conn).serve
-1.40s 0.50% 1.15% -1.40s 0.50% encoding/json.Marshal
+0.05s 0.018% 1.13% +0.05s 0.018% myapp/handlers.Checkout
... (other shifts < 0.5s) Production p99 dropped 29% (820→580ms) after a deploy. CPU went UP slightly (58→62%). The CPU profile diff shows only ~1% net CPU reduction. How do you reconcile the headline win with the small CPU shift?
Pick the right measurement scope for the question 'is this 10x microbench speedup of HashMap going to make my API faster?'
Design the 'profile-first' programme for a 50-engineer platform team running 30 services in production. Within six months: every perf PR must cite a profile; every production incident runbook must produce a profile within 5 minutes; profile-diff CI gates must run on critical-path services.
- Polyglot mix: Go, Node, Python, JVM.
- Existing stack: Prometheus + Grafana + Tempo + Loki; no continuous-profiling backend yet.
- Budget ceiling: $3k/month for new tooling.
- No formal performance engineer; the practice must be self-sustaining.
- Stand up continuous profiling backend within 4 weeks.
- Polyglot collection: native agents + eBPF DaemonSet baseline.
- Runbook integration: every incident page links to a profile within 5 minutes.
- PR template: baseline profile + Amdahl prediction + post-fix diff mandatory.
- CI profile-diff gates on critical-path services; tune thresholds.
- Quarterly profile reviews on top-10 services by CPU.
- Cost ≤$3k/month; RBAC + CAP_PERFMON for security.
- 01How does profile-trace correlation work technically, and what does the triage workflow look like with it in place?
- 02Walk through how you would set up a profile-diff CI gate for a critical-path Go service, including thresholds and the failure modes you expect in the first month.
Continuous profiling at 2-5% overhead is the 2026 standard, but the storage and CPU cost compounds across a fleet — 200 services at 2% overhead equals four permanent extra services. Tiered retention and symbol deduplication bring net storage cost to $25-100/month. Profile-trace correlation via trace-id stamping in each stack sample reduces incident triage from minutes of manual capture to a 30-second click-through. Profile-diff CI gates catch regressions before merge, cutting mean-time-to-detect from days to minutes. Five common anti-patterns: optimising cold paths, microbench-driven rewrites without production share, refusing to profile production, single-run reporting, and feature-flagged improvements that never get enabled. The chapter’s foundation: every subsequent optimisation technique — hot paths, GC, N+1, batching, bundle budgets — is an answer to a question profiling raised.
appears again in159
- 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
- What the three signals are: logs, metrics, and tracesjunior
- Metrics and cardinality: the cost model of a time-series databasemiddle
- Logs and volume: the cost model of structured loggingmiddle
- Traces and sampling: the cost model of distributed tracingmiddle
- Join keys and exemplars: making the three signals composemiddle
- Observability 2.0: wide events and the cost shiftsenior
- Failure modes and engineering practice: cardinality budgets, PII, and samplingsenior
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- Log levels and alert routingmiddle
- Sampling strategies and log costmiddle
- PII redaction and log injectionsenior
- Trace context propagation in logssenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- OTel signals, Semantic Conventions, and the OTLP wire formatmiddle
- Auto-instrumentation and manual spans: the 80/20 of OTelmiddle
- The OTel Collector: receivers, processors, exporters, and deployment patternsmiddle
- Sampling strategies: head, tail, and parent-basedmiddle
- Vendor neutrality, eBPF instrumentation, the Operator, and browser/serverless OTelsenior
- Operating the OTel Collector: reliability, version skew, failure modes, and governancesenior
- RED and USE: two checklists, one triage disciplinejunior
- 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
- Choosing SLIs and SLO targets: ratios, not feelingsmiddle
- Multi-window multi-burn-rate alerting: why AND beats ORmiddle
- Error budget policy, latency SLOs, and composite journeysmiddle
- Iceberg SLIs, composite SLO math, and SLA vs SLOsenior
- Flame graphs: reading the picture that shows where time goesjunior
- Sampling vs instrumentation profiling: why 99 Hz wins in productionmiddle
- Profile types: CPU, memory, off-CPU, mutex — which one to reach formiddle
- Continuous profiling: always-on flame graphs with eBPF and trace-id correlationmiddle
- How flame graphs are built from samples, and the production workflows that use themmiddle
- Linux perf, eBPF internals, PGO, and the limits of samplingsenior
- Profiling in production: security, war stories, OTel profiles, and the infrastructure designsenior
- The debugging funnel: SLO → RED → trace → profilejunior
- OTel architecture: one SDK, four signals, one wire formatmiddle
- Cost discipline: keeping observability under 5% of infra spendmiddle
- Scale, security, and the ROI of observable systemssenior