Browser & Frontend Runtime
The event loop: one thread, three queues
A button click feels instant. A scroll judders. A modal blocks for 300 ms while JSON parses. The thing that decides which experience the user gets is one piece of machinery older than the modern web: the event loop.
What the event loop does
The browser has one thread that runs your JavaScript. While it is busy, nothing else runs — no clicks, no animations, no rendering. The event loop decides what runs next when the thread frees.
The loop has three players:
- Task queue (macrotask queue) — discrete jobs:
setTimeoutcallbacks, parsed HTML chunks, fired DOM events, message-channel messages. - Microtask queue — promise-resolution callbacks and
queueMicrotaskjobs. Drains to empty after every task. - Rendering steps — style, layout, paint, composite. Run between iterations, but only when the browser thinks a frame is due.
- Frame budget at 60 fps
- 16.67 ms
- Long-task threshold
- 50 ms
- Good INP (p75)
- ≤200 ms
- setTimeout(0) clamp after 5 levels
- 4 ms
- React 18 work slice
- 5 ms
- Cross-thread postMessage hop
- ~1 ms + clone
The barista metaphor
Imagine a one-person coffee shop. Customers put orders on the counter (the task queue). When the barista finishes one drink, she checks for sticky notes on the espresso machine (microtasks — small follow-ups like “add cinnamon”) and does every one before greeting the next customer. If she keeps writing herself sticky notes faster than she finishes them, she never reaches the next customer at all. That failure mode is microtask starvation.
Every animation, keystroke, click, and scroll is a queued task waiting for the thread. Hold the thread for 200 ms and the user sees 200 ms of frozen UI. The fix is not “faster code” — it is “shorter tasks.”
One iteration, step by step
One loop iteration does exactly this:
| Step | What runs | When skipped |
|---|---|---|
| 1. Select task | Pull one task from a non-empty task queue | If all queues empty, idle |
| 2. Run task | Execute the callback to completion | Never skipped if step 1 ran |
| 3. Microtask checkpoint | Drain the microtask queue | Microtask queue empty |
| 4. Update rendering | rAF → style → layout → paint → composite | Only on frame boundary (~16.67 ms) |
| 5. Loop back | Return to step 1 | Never |
A concrete walk-through
Bea clicks Submit. Sven narrates: “The click queues as a task. The submit handler runs — 4 ms to validate, queues a fetch. The fetch resolves later, schedules a .then() microtask that mutates state. React re-renders — more work on the same thread. Total: 28 ms. Frame budget is 16.67 ms, so the user sees one dropped frame.”
Inside one iteration of the browser's event loop, these steps run in a fixed order. Drag them into the right sequence.
- 1 Pull one task from the task queue and run it to completion
- 2 Drain the microtask queue (run promise callbacks until empty)
- 3 Run requestAnimationFrame callbacks (only if a frame is due)
- 4 Style → layout → paint → composite (only if a frame is due)
- 5 Loop back: pull the next task
Inside a `setTimeout` handler you call `Promise.resolve().then(work)`. When does `work` run?
A click handler runs for 400 ms. Which of these continues to work during the block?
In the barista metaphor, customer orders sit on the counter — that is the task queue. The barista's own sticky notes from the previous order, which she finishes before greeting the next customer, are which kind of queue?
A task takes longer than this many milliseconds and the browser officially calls it a 'long task' that contributes to a poor INP score.
- 01What are the three players in the browser event loop?
- 02Why does a 400 ms click handler freeze the page even though CSS animations are still running?
- 03What is the W3C threshold for a 'long task', and why does it matter for INP?
The browser event loop is a single-threaded engine that processes one task at a time — a setTimeout callback, a click handler, a parsed HTML chunk. After each task, it drains the microtask queue completely (promise resolutions, MutationObserver callbacks) before it can render or handle input. This makes the microtask queue behave as an extension of the running task from the renderer’s perspective. Tasks longer than 50 ms are long tasks; they delay both rendering and user-input handling, directly inflating the INP metric. The frame budget at 60 fps is 16.67 ms, so a 200 ms task drops roughly 12 frames and the user perceives obvious jank.
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- What workers are and why they existjunior
- INP: input delay, processing, presentationmiddle
- The full picture: URL to LCP to INP as a relay racejunior
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