Performance
Hardware counters and Intel TMA: sub-category diagnosis
A flame graph names a hot function. Two engineers argue: one says “rewrite the algorithm,” the other says “fix the memory layout.” Both frames look identical at the flame graph level. Running perf stat -e instructions,cycles,cache-misses against the function resolves the argument in 30 seconds: IPC is 0.4, cache-miss rate is 18%. Memory layout wins. The algorithm change would have wasted a sprint.
Hardware counters: the second pass
A flame graph names the function. Hardware performance counters tell you what the function is doing inside the CPU. Linux’s perf stat -e cycles,instructions,cache-misses,branch-misses attached to the same hot leaf gives IPC, miss-rates, and stall types.
- Wide frame with IPC of 3.0: compute-bound. The CPU is executing the algorithm. Fix family: algorithm, SIMD, specialisation.
- Wide frame with IPC of 0.4 and 15% cache-miss rate: memory-bound. The CPU is stalled on RAM. Fix family: data layout change.
Same width on the flame graph, opposite fixes. Hardware counters are the second-pass diagnostic that prevents wrong-toolbox optimisation on subtle hot paths.
| Counter reading | Category | Fix family |
|---|---|---|
| IPC 2–4, low cache-miss rate | Compute-bound (CPU-bound) | Better algorithm, vectorisation (SIMD) |
| IPC <1, high cache-miss rate | Memory-bound (cache-bound) | Data layout (SoA, contiguous), iteration order |
| High branch-miss rate | Bad speculation | Branch elimination, branchless code, sorted inputs |
| High stall cycles, low instructions | Front-end bound (instruction fetch/decode) | Code size reduction, instruction cache optimisation |
Intel TMA: a rigorous taxonomy
The five-shape model is a working approximation. The rigorous version is Intel’s Top-Down Microarchitecture Analysis (TMA), formalised in the Intel Optimization Manual and exposed by VTune, Linux perf (via toplev.py), and AMD’s uProf equivalent.
TMA classifies each CPU cycle into four top-level buckets:
- Retiring (~25–50% on optimised code): real work — the CPU executed useful instructions.
- Bad Speculation (~5–15%): branch misprediction — pipeline was flushed, instructions were discarded.
- Front-End Bound (~5–15%): instruction fetch or decode stalls — the CPU cannot keep the pipeline full with new instructions.
- Back-End Bound (~30–60% on typical workloads): memory or compute resources stalled.
Back-End Bound breaks down further:
- Memory Bound → L1 Bound, L2 Bound, L3 Bound, DRAM Bound, Store Bound
- Core Bound (compute ports, dependency chains, long-latency dividers)
The cascade pinpoints exactly which CPU resource the hot path is starved of:
- DRAM-bound → data-layout fix
- Bad Speculation → branch elimination
- Front-End Bound → code size reduction
- Core Bound → true algorithmic redesign or SIMD
For senior performance work on critical-path services, TMA is the highest-resolution diagnosis available. Teams shipping latency-sensitive infrastructure (HFT, database engines, kernel hot paths) treat it as standard.
Why this works
Linux’s toplev.py script implements TMA using perf events on any modern Intel CPU. It walks the TMA tree automatically and prints which bucket dominates. A typical invocation: toplev.py --core S0-C0 -l2 sleep 5. The output maps directly to the four-bucket and sub-bucket structure and names which hardware resource is the constraint.
Read hardware counter output to diagnose a memory-bound path
# perf stat -e cycles,instructions,cache-misses,LLC-load-misses ./service --bench feed-rank
8,400,000,000 cycles
3,360,000,000 instructions # 0.40 insns per cycle (IPC)
900,000,000 cache-misses # 10.7% of all memory refs
700,000,000 LLC-load-misses # 78% of cache misses miss L3 too
# Hot function from flame graph: score_embeddings()
# Self-time: 42% CPU
# IPC: 0.40 ← CPU stalled 60% of the time
# L3 miss rate: very high — going to DRAM on most accesses IPC is 0.40 and 78% of cache misses are reaching DRAM. What is the TMA bucket, and what fix family does it point to?
A hot leaf is JSON serialisation at 28% CPU. The team has four options. Pick the senior choice.
Where is the rigorous Top-Down Microarchitecture Analysis (TMA) framework — Retiring / Bad Speculation / Front-End Bound / Back-End Bound — formalised, and which tool exposes it directly?
A hot path showed function X at 25% CPU. After a fix, it dropped to 5%. Total CPU% stayed the same. What is the most likely systemic explanation?
- 01When should you reach for hardware counters instead of just reading the flame graph, and what do they tell you that the flame graph cannot?
- 02Describe TMA's four-bucket cascade and what fix each bucket maps to.
Hardware performance counters are the second-pass diagnostic that distinguishes compute-bound from memory-bound hot paths when both look identical on the flame graph. IPC below 1 with high L3 miss rate points to data-layout fixes; IPC 2-4 with low miss rate points to algorithmic fixes. Intel’s TMA framework cascades from four top-level buckets down to specific sub-resources (L1-bound, DRAM-bound, core-bound), giving the most precise diagnosis available. For latency-sensitive production services, running perf stat or VTune on ambiguous hot leaves is standard practice before committing engineering time to a fix.
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