Browser & Frontend Runtime
Timer accuracy, throttling, and idle work
Your polling loop drifts. A background tab’s setInterval fires once a minute instead of every second. A diagnostic timer meant to measure 50 ms measures 120 ms. Timers in the browser are a promise with asterisks, and the asterisks multiply the moment something else is busy.
Why setTimeout is a lower bound, not a guarantee
A setTimeout(fn, 100) does not promise to run fn in exactly 100 ms — it promises to queue the task no sooner than 100 ms. The actual run time depends on when the main thread is next free. If a 300 ms task is in flight when the timer fires, your callback waits the full 300 ms plus its queue position.
Three throttling layers compound this:
Layer 1 — the 4 ms nesting clamp. After 5 levels of setTimeout nesting (or setInterval), browsers clamp the delay to a minimum of 4 ms. This is a spec rule, not a quirk: it prevents setTimeout(0) chains from busy-looping the main thread. A 100-iteration loop using setTimeout(0) takes at least 400 ms regardless of how fast the work is.
Layer 2 — background-tab throttling. When a tab is hidden (document.visibilityState === 'hidden'), browsers clamp timers to a 1-second minimum. After the tab has been hidden for several minutes, Chrome further reduces to once per minute. Your background polling loop quietly slows to a crawl.
Layer 3 — timer alignment / coalescing. To save battery, browsers round timer fire times to a shared grid so the CPU can wake once for many timers instead of many times. The practical consequence: never use setTimeout/setInterval for anything needing sub-frame precision. For animation use requestAnimationFrame; for precise scheduling use the AudioContext clock or performance.now() deltas inside a rAF loop.
- Normal minimum delay
- 0 ms (but queue-position-dependent)
- Nesting clamp (depth ≥5)
- 4 ms minimum
- Background tab
- ≥1 000 ms
- Background tab (many minutes)
- ≥60 000 ms
- Battery-saving coalescing
- grid alignment, ~1 ms jitter
A page calls `setTimeout(loop, 0)` where `loop` re-schedules itself. After 5 nesting levels, what happens to the effective delay?
Page visibility and the event loop lifecycle
The event loop does not stop when a tab goes to the background, but it changes mode. document.visibilityState switches to hidden, requestAnimationFrame stops firing entirely (no drawing = no rAF), and timers throttle as above.
The visibilitychange event is the right place to stop polling, pause video, flush unsaved state. The modern replacement for the unreliable unload event is pagehide plus the Page Lifecycle API with frozen and terminated states: the browser can fully freeze a background tab (stopping its loop entirely) to free memory, then thaw it on return. Code holding open connections or timers must listen to freeze/resume, or after thaw it is running with stale state — a closed WebSocket, an expired token, a detached observer.
A background tab runs a 1-second polling setInterval. After 5 minutes in the background, how often does Chrome typically fire the callback?
requestIdleCallback — scheduling non-urgent work
Not all work is urgent. Analytics beacons, prefetching, cache warming, and log flushing can wait until the loop has nothing better to do. requestIdleCallback(fn) queues a callback that the browser runs only when an iteration finishes with spare time before the next frame deadline. The callback receives a deadline object whose timeRemaining() tells you how many ms you may safely use (capped around 50 ms).
The discipline: do a small slice, check timeRemaining(), and if it is near zero, re-schedule the rest with another requestIdleCallback. The optional { timeout } parameter forces the callback to run anyway after the deadline so the work is not starved forever.
requestIdleCallback is the cooperative opposite of requestAnimationFrame: rAF says “run me right before the next paint,” ridle says “run me only if nobody else needs the thread.” Used together they let you keep urgent work on rAF and defer everything else off the critical path.
requestIdleCallback's `deadline.timeRemaining()` is capped at roughly this many milliseconds — the same as the long-task threshold.
Promise combinators and scheduling
Promise.all, Promise.allSettled, Promise.race, and Promise.any change what you wait for, not how the loop schedules. All four start every passed promise immediately — the parallelism comes from kicking off async operations before awaiting.
Promise.all— rejects on the first failure (fail-fast). Right when any failure makes the whole result useless.Promise.allSettled— never rejects; resolves with a status array. Right when you want partial results (five independent dashboard widgets where one failing should not blank the others).Promise.race— settles on the first to settle, success or failure. Classic use: timeout:Promise.race([fetchData(), rejectAfter(5000)]).Promise.any— resolves on the first success, ignoring rejections until all fail. Right for redundancy, like racing three CDN mirrors.
Picking the wrong combinator is a correctness bug, not a perf bug: Promise.all for a dashboard means one slow widget’s failure blanks the page.
A common bug worth naming: writing const a = await fetchA(); const b = await fetchB(); when both fetches are independent. The two requests run sequentially because the second await does not start until the first resolves. const [a, b] = await Promise.all([fetchA(), fetchB()]) kicks off both immediately. The cost difference is one full RTT. The clue in DevTools is two network requests with non-overlapping timing where both could have run in parallel.
You have five independent API calls for a dashboard. One of them may fail. Which combinator fits?
A background tab's `visibilitychange` event fires. The code holds an open WebSocket and a `setInterval` polling loop. What should it do?
- 01Name the three throttling layers that compound on setTimeout accuracy.
- 02When should you use requestIdleCallback instead of setTimeout(fn, 0)?
- 03Why is `const a = await fetchA(); const b = await fetchB();` a bug when both fetches are independent?
setTimeout(fn, delay) queues the task no sooner than delay milliseconds, but the actual fire time depends on main-thread availability and three throttling layers: the 4 ms nesting clamp (prevents setTimeout(0) busy-loops), background-tab throttling (1 s → 1 min), and timer coalescing for battery savings. For precise timing in animations, use requestAnimationFrame or the AudioContext clock — both are driven by the rendering pipeline, not the timer queue. For non-urgent work, requestIdleCallback runs only during genuine idle gaps and gives you a timeRemaining() budget to slice work safely. Promise combinators do not change loop scheduling but do change correctness: Promise.all for fail-fast, Promise.allSettled for partial results, Promise.race for timeouts, Promise.any for first-success redundancy.
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- Event loop: rescue an interaction from INP hellsenior
- Event loop: multiple-choice reviewsenior
- Event loop: predict the outputsenior
- Event loop: free-recall reviewsenior
appears again in193
- 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
- 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
- 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