Browser & Frontend Runtime
Stage costs and the renderer process model
Your page parses fast on your M2 MacBook. It crawls on a mid-range Android. The bottleneck is never “the CPU is slow” — it is which thread is doing which work, and how much of it is on the thread that cannot be parallelised.
The renderer process model
A modern Chromium-family browser runs each tab in its own renderer process. Inside that process:
- Main thread — runs HTML parsing, CSSOM construction, style, layout, paint setup, and your JavaScript. It is single-threaded by design: DOM, CSSOM, and JS state can only be mutated by one execution context at a time, otherwise consistency would be impossible.
- Compositor thread — assembles the layer tree and decides which layers need new bitmaps.
- Raster worker threads — rasterise individual tiles in parallel.
- GPU process — takes rasterised tiles, uploads them as textures, and runs the final composite-and-display.
Firefox uses a similar split (Quantum CSS for parallel style, WebRender for GPU-driven compositing); Safari/WebKit splits across its WebContent process and the GPU process. Names differ; the architecture rhyme is universal.
Renderer process internals (Chromium)
Main thread
Parse HTML → CSSOM → Style → Layout → Paint setup
+ your JavaScript
Compositor thread
Assembles layer tree, decides dirty tiles
Raster workers (N)
Rasterise tiles in parallel
GPU process
Upload textures, composite and display
Why the main thread is the bottleneck
Any work you put on the main thread — parsing a JSON blob, deserialising a Redux state, running a layout, executing a click handler — competes for the same 16.67 ms window. The compositor and raster threads exist precisely so rendering work can leave the main thread and run in parallel.
That is the architectural justification for transform/opacity animations being “free”: they reach the GPU without touching the bottleneck thread.
Stage-by-stage cost drivers
Each stage has typical levers that blow up its cost.
Parse HTML scales with document bytes. A 500 KB SSR-rendered page parses faster than a 2 MB one, simply because there is less to walk. Synchronous <script> tags block the parser until they finish downloading and executing — modern best practice puts defer or async on every external script not strictly needed for first paint.
CSSOM cost grows with stylesheet bytes and rule count. An unused 800-rule CSS framework wastes parse time even if zero rules actually match anything on the page.
Style calc cost is roughly DOM size × selectors. A 5 000-node DOM with a 2 000-rule stylesheet is 10 million selector-match checks. Most selectors are skipped via a bloom filter, but :has(), descendant combinators with no ancestor anchor, and universal selectors defeat the filter and cost more.
Layout cost is roughly DOM depth × box dependencies. A deeply nested flexbox with auto sizing forces multiple measure passes; a flat grid with explicit cell sizes is one pass.
Paint cost is painted area × paint op count. box-shadow with a large blur radius and filter properties (blur, drop-shadow) are paint-heavy because each pixel requires multi-pixel sampling.
Composite cost is layer count × layer pixel area. The cheap stages are cheap by orders of magnitude, but only if the upstream stages don’t invalidate downstream.
Why this works
Why is the DOM single-threaded at all? Because two execution contexts writing the same DOM node concurrently without locking would require a full concurrent garbage collector and would still leave subtle race windows open. Java tried this with Swing’s UI thread rule; the browser inherited the same constraint. The single-thread rule is a deliberate correctness trade-off, not an oversight.
You change a div's `top` property in a rAF loop. Which pipeline stages re-run per frame?
You change `transform: translateX(...)` on a div that already has its own compositor layer. Which stages run on the main thread?
DevTools Performance panel shows a 28 ms frame. Inside: 1 ms Parse HTML, 2 ms Recalculate Style, 18 ms Layout, 4 ms Paint, 1 ms Composite Layers, 2 ms idle. The page is scrolling a list of 5000 chat messages. Where is the time?
A DOM has 5000 nodes. The stylesheet has 2000 rules. Roughly how many selector-match checks does style calc perform?
- 01What four threads/processes does a Chromium renderer process use?
- 02Why is the main thread single-threaded?
- 03What is the cost driver for style recalculation?
The renderer process has four players: main thread, compositor thread, raster workers, and GPU process. Five of the six pipeline stages run on the single main thread — the same thread as your JavaScript — so every long task competes with rendering. Stage costs are predictable: parse scales with bytes, style calc with DOM × rules, layout with DOM depth × box dependencies, paint with area × ops, composite with layer count × pixel area. Composite-only animations (transform, opacity) skip the main thread entirely; that is why they are an order of magnitude cheaper than layout-triggering ones.
appears again in143
- Why GraphQL gets N+1junior
- DataLoader mechanics: tick-boundary batchingmiddle
- Batch function contracts: ordering, shapes, errorsmiddle
- Federation and lookahead: batching beyond DataLoadermiddle
- Query complexity defences: depth, cost, persisted queriesmiddle
- Senior GraphQL API: scheduling contract, tenant isolation, observabilitysenior
- Why idempotency: making retries safejunior
- Server-side state machine: four states of an idempotency keymiddle
- Outbox and inbox: effectively-once across the dual-write boundarymiddle
- Concurrency and cache architecture for idempotency at scalesenior
- Observability, production failures, and global-scale designsenior
- What is a cache stampede and why it makes things worsejunior
- Lock and single-flight: bounding concurrent rebuildsmiddle
- XFetch: coordination-free probabilistic early expirationmiddle
- Stale-while-revalidate and CDN request coalescingmiddle
- Detecting stampedes and designing TTL for productionmiddle
- Metastable failure, fencing tokens, and production postmortemssenior
- What a relation is: tables, rows, keys, and constraintsjunior
- Constraints, keys, and Postgres data typesmiddle
- Normal forms, denormalization, and why schemas stickmiddle
- JSONB, arrays, and when a side table winsmiddle
- Heap storage, TOAST, and column alignmentsenior
- Schema integrity: deferral, versioning, and production failure modessenior
- Relational vs document, wide-column, graph, and key-valuesenior
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- pg_statistic, ANALYZE, and production observabilitymiddle
- Production failure modes and plan stabilitysenior
- MVCC: why readers and writers never wait for each otherjunior
- Row versions and snapshots: the on-disk mechanicsmiddle
- HOT updates and isolation levels: what you gain and what you paymiddle
- Vacuum and bloat: keeping the storage tax boundedmiddle
- CLOG, XID wraparound, and MultiXact: deep visibility internalssenior
- SSI internals and production autovacuum tuningsenior
- Real-world MVCC failures, deployment patterns, and distributed snapshotssenior
- 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
- What a schema migration is and why it replaces ad-hoc DDLjunior
- 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
- Expand-contract: zero-downtime for breaking schema changesmiddle
- Advisory locks, migration tools, and deploy coordinationsenior
- Migration failure taxonomy and production disciplinesenior
- Why sharding exists: the single-Postgres ceilingjunior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Partitioning vs sharding: same word, two different thingsmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Schema-based sharding and multi-tenancy alternativessenior
- 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
- Raft roles, terms, and why majority quorums prevent split brainjunior
- How Raft replicates a log entry and decides it is safe to commitmiddle
- Raft leader election: timeouts, voting rules, and the four safety propertiesmiddle
- Raft in the real world: partitions, slow disks, and client routingmiddle
- Raft extensions: pre-vote, learners, snapshots, and linearizable readssenior
- Raft in production: membership changes, Multi-Raft, and observabilitysenior
- Where data fetching happens — and why it decides LCPjunior
- Fetch waterfalls — diagnosis and the Promise.all curemiddle
- React Server Components and Suspense streamingmiddle
- Client-side cache: TanStack Query, SWR, and stale-while-revalidatemiddle
- LCP, prefetch, and race conditions in interactive fetchingmiddle
- Senior internals: RSC payload, caching layers, and production failure modessenior
- The three-way handshakejunior
- Sequence numbers and connection statemiddle
- DNS: what it does and why it existsjunior
- The resolver walk: referrals, record types, and gluemiddle
- TTL, caching, and DNS propagationmiddle
- The 1-RTT handshake: key shares and ECDHEmiddle
- Session resumption and 0-RTTmiddle
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket frame format: opcodes, masking, fragmentationmiddle
- 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
- Health checks, connection draining, and slow startmiddle
- Session affinity, consistent hashing, and the right fixmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- Connection IDs and network migrationmiddle
- 0-RTT resumption and packet encryptionsenior
- 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
- DNS, TCP, TLS in sequence: where the milliseconds gomiddle
- 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
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- PII redaction and log injectionsenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- SLI, SLO, and the error budget: reliability by the numbersjunior
- Error budget policy, latency SLOs, and composite journeysmiddle
- Production SLO failures, self-observability, security, and the big picturesenior
- The incident loop: from pager to postmortem to preventionmiddle
- Cache lines, struct layout, and false sharingmiddle
- SIMD, SoA vs AoS, and memory bandwidthmiddle
- Cache-oblivious algorithms, PGO, and production failuressenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- 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
- 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
- At-most-once, at-least-once, exactly-once: the three delivery contractsjunior
- The three failure legs — where duplicates and losses actually happenmiddle
- Consumer-side dedup: the cheapest path to exactly-once processingmiddle
- Kafka exactly-once semantics: idempotent producer and transactionsmiddle
- SQS visibility timeout, DLQ, and the outbox patternmiddle
- Exactly-once in production: impossibility proof, hybrid patterns, and real incidentssenior
- What OAuth is and why passwords are not the answerjunior
- Authorization code flow with PKCEmiddle
- ID token validation and JWKS cache managementmiddle
- Refresh token rotation and scope-based least privilegemiddle
- Sender-constrained tokens: DPoP and mTLSsenior
- OAuth in production: audience attacks, observability, and real failuressenior