Observability
Continuous profiling: always-on flame graphs with eBPF and trace-id correlation
An SLO burns at 2:14 AM. The pager wakes the on-call. Traditional profiling requires them to SSH in, reproduce the issue under load, capture a profile, and parse it — at 2:14 AM, under pressure. Continuous profiling already has the flame graph for 2:14 AM waiting in a dashboard.
Traditional vs continuous profiling
Traditional (on-demand) profiling: SSH in, run perf record or hit /debug/pprof/profile, gather data, analyse, leave. Cost: only during capture. Limitation: requires you to be present and the issue to be actively occurring. For intermittent issues or incidents that self-resolve, you lose the evidence.
Continuous profiling: an agent runs on every host or container, sampling 100 times per second continuously, batching and shipping compressed profiles every 10-15 seconds to a backend. The backend stores them indexed by service, host, and time range. Storage: ~50-200 MB/day per service, ~1.5-6 GB/month. Overhead: 2-5% CPU. The critical win: when an SLO burns, the profile of the burning minutes is already saved.
eBPF: language-agnostic profiling
Traditional language profilers (Go pprof, JFR, async-profiler, py-spy) require language-specific support — the runtime must expose stack walking APIs. For Python, Ruby, and older PHP interpreters, this requires hooks the runtime team must provide.
eBPF profilers (Pyroscope eBPF mode, Parca) read stacks from the kernel side: the kernel’s perf_event_open syscall plus a BPF-attached probe captures user-space stacks at sample time. This means:
- Works for any language, any binary, with no application code change.
- One agent covers all services on the host — Go, Java, Node, Python.
- Catches third-party library overhead that language-specific profilers might miss.
The catch: symbol resolution. The kernel sees memory addresses; the profiler maps them back to function names using debug info (DWARF, BTF, JIT-emitted symbol files for V8 or JVM). Most production eBPF profilers handle this; occasional [unknown] frames appear when DWARF is stripped or JIT code is too volatile.
Cross-language profiler coverage
| Language | Native profiler | eBPF coverage |
|---|---|---|
| Go | pprof (built-in) | Full — frame pointers standard |
| Java | JFR, async-profiler | Partial — needs JIT symbol maps |
| Python | py-spy, cProfile | Limited — interpreter frames opaque |
| Node.js | —prof, clinic.js, 0x | Partial — V8 needs —perf-prof flag |
| Rust / C / C++ | perf, pprof-rs | Full — compiled with frame pointers |
Trace-id correlation: from slow span to flame graph in 30 seconds
Each profile sample can carry the trace-id of the request being processed at the moment of sampling — stored in thread-local context. When a slow trace appears in the trace view, the matching profile samples (only those carrying that trace-id) can be filtered out and rendered as a flame graph for that specific request.
This is the bridge between “where did time go in the request” (trace span) and “what code ate the CPU” (profile). The workflow:
- SLO alert fires — p99 latency over budget.
- Open trace view — find slow spans, note trace-id.
- Open profile view filtered by trace-id — flame graph for that exact request appears.
- Widest frame is the function to fix.
- Done in under 60 seconds.
OpenTelemetry’s profile signal (stabilising in 2025-2026) standardises this linkage. Production-grade observability platforms (Datadog, Grafana with Pyroscope, Honeycomb) ship this drilldown out of the box.
Profile storage economics
- Profile size per 30-second capture
- ~50-500 KB compressed
- Profiles per hour (15-s intervals)
- 240
- Storage per service per day
- ~50-200 MB
- Storage per service per month
- ~1.5-6 GB
- Fleet of 200 services
- 300 GB - 1.2 TB/month
- Object storage cost
- ~$0.02/GB ≈ $25/month
- Pyroscope 2.0 storage improvement
- ~3x vs v1 via symbol deduplication
Pyroscope 2.0 (released April 2026) cut storage 3x by deduplicating symbols across profiles from the same binary — function names and source paths are shared in a common symbol table instead of repeated in every profile.
Retention strategy: 7 days full-fidelity for active debugging, 30 days downsampled (one profile per 5 minutes), 90 days for long-term trend analysis. Budget-conscious teams cap at 14 days fine + 60 days coarse.
An eBPF profiler shows many '[unknown]' frames for a Python service. What is the cause?
What does trace-id correlation in continuous profiling enable that a standalone CPU profile cannot provide?
- 01What is the critical operational advantage of continuous profiling over on-demand profiling during incidents?
- 02Why does an eBPF profiler work for Go and Rust but produce [unknown] frames for Python?
- 03How does trace-id correlation work mechanically?
Continuous profiling agents run on every host, sample stacks 100 times per second, and ship compressed profiles every 10-15 seconds to a backend like Pyroscope or Parca. At 2-5% overhead, this is affordable enough to leave always-on. eBPF agents capture stacks from the kernel side without language-specific hooks — one agent per host covers Go, Java, Node, and Python, though interpreter-based runtimes need extra support for accurate symbol resolution. Trace-id labels on every sample enable a flame graph filtered to one specific request in under 30 seconds. Pyroscope 2.0’s symbol deduplication cut storage costs 3x, making per-service monthly storage under 10 GB. The SLO → trace → profile workflow reduces MTTR for any CPU-bound incident to under 90 seconds.
- Linux perf, eBPF internals, PGO, and the limits of samplingsenior
- Profiling in production: security, war stories, OTel profiles, and the infrastructure designsenior
- Profiling: from SLO to flame graphsenior
- Profiling: multiple-choice reviewsenior
- Profiling: profile and config readingsenior
- Profiling: free-recall reviewsenior
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