Observability
Sampling vs instrumentation profiling: why 99 Hz wins in production
Your staging server runs under profiling with no problem. The same profiler in production raises latency by 40%. The profiler didn’t change — the load did. Understanding why is the difference between a tool you can run always and one you can only use in emergencies.
Two ways to profile
Instrumentation profiling works by wrapping every function entry and exit with timing code. The runtime measures exactly how many times each function was called and exactly how long it ran. The cost is proportional to function call frequency — at 10 million calls per second, you pay 10 million timing measurements per second. On a dev machine with light load this is fine; under production traffic it can add 20-100% overhead. Instrumentation is great for small, isolated benchmarks; it is not viable for always-on production profiling.
Sampling profiling works differently: an external clock fires N times per second and captures the current call stack. The cost is exactly N stack walks per second regardless of how many function calls happen between them. At 100 Hz that is 100 stack walks per second — each costing ~5-20 microseconds — giving an overhead of roughly 0.5-2% on a busy CPU. Modern profilers (Go pprof, Linux perf, Java async-profiler, py-spy, eBPF-based profilers) are all sampling-based. The cost is bounded.
The key statistical property
At sample rate R Hz, a function that uses X% of CPU will appear in X% of samples — regardless of how many times it was called. The statistic reported is “fraction of CPU time,” not “call count.” This is exactly the right metric for finding bottlenecks: you want to know which function is on the CPU most often, not which function is called most often.
The consequence: sampling at 100 Hz is sufficient to find functions consuming more than a few percent of CPU. A function using 10% of CPU will hit ~10 samples per second. A 30-second profile gives 300 samples of that function — plenty for a reliable estimate.
Sample rate choices in the wild
Linux perf defaults to 99 Hz — not 100 Hz. This is deliberate: 100 Hz can accidentally synchronise with periodic kernel timers and produce misleading results. 99 Hz avoids the resonance. Go pprof defaults to 100 Hz. eBPF-based continuous profilers typically use 19 or 49 Hz to minimise impact on very busy containers.
| Approach | Cost model | Typical overhead | Use case |
|---|---|---|---|
| Instrumentation | Per function call | 20-100% | Dev benchmarks, targeted micro-benchmarks |
| Sampling (Go pprof) | Per sample (100/s) | 0.5-2% | Production on-demand or continuous |
| Sampling (eBPF) | Per sample (19-49/s) | 1-3% | Continuous, polyglot fleets |
| Continuous profiler (full) | Sampling + batching + shipping | 2-5% | Always-on production fleet |
- Go pprof default sample rate
- 100 Hz
- Linux perf default rate
- 99 Hz (avoids timer sync)
- eBPF profiler typical rate
- 19 or 49 Hz
- Stack walk cost per sample
- ~5-20 μs
- Overhead at 100 Hz, busy CPU
- ~0.5-2%
- Continuous profiler (full pipeline)
- 2-5% CPU
When the claimed 2-5% overhead becomes 12%
A continuous profiler claims 2% overhead; you measure 12% in production. The most common causes:
- Sample rate was accidentally set 10x higher than default.
- Stack walking is expensive because the language runtime uses JIT-compiled code requiring symbol resolution at sample time (Python, JVM without native hooks).
- The agent is doing heavy symbol decompression or compression on the application thread instead of async.
- Average stack depth is 120+ frames (deep middleware chains) — each sample costs proportionally more to walk.
Always check profiler config before assuming the tool is misbehaving.
A service makes 5 million function calls per second. An instrumentation profiler adds 1 μs per call. A sampling profiler runs at 100 Hz and costs 10 μs per sample. Which adds less overhead?
Linux perf defaults to 99 Hz, not 100 Hz. Why?
- 01Why is instrumentation profiling impractical for always-on production profiling?
- 02A sampling profiler reports a function at 8% of samples. What does this mean in terms of CPU usage?
- 03Why does Linux perf use 99 Hz instead of 100 Hz?
Instrumentation profiling wraps every function call, giving exact data but collapsing under production load as overhead scales with call frequency. Sampling profiling fires a clock N times per second and captures the current stack — bounded overhead regardless of how many functions are called between samples. At 100 Hz and ~10 μs per stack walk, the overhead is 0.5-2%; a full continuous profiler pipeline (with batching and shipping) adds to 2-5%. The statistical property that makes sampling powerful: a function consuming X% of CPU appears in X% of samples, so you get CPU share estimates without touching every call. Linux perf defaults to 99 Hz to avoid synchronising with periodic kernel timers — a subtle correctness detail every senior engineer should know.
- 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