Microtasks vs macrotasks: ordering
One macrotask runs per loop turn; the entire microtask queue drains after each macrotask and whenever the JS stack empties. A microtask that enqueues a microtask runs in the same drain — the root of starvation. Plus Node's process.nextTick ordering.
A junior asks you to “fix the bug” where this prints 1 4 3 2 instead of 1 2 3 4. There is no bug. The order is the contract: a setTimeout callback waits its turn as a macrotask while a Promise.then jumps ahead as a microtask. If you cannot predict that interleaving cold, you cannot reason about a race in production — and you certainly cannot explain why a tight promise chain just froze the tab.
Two queues, two cadences
The previous lesson fixed who owns what: the host owns the loop and the macrotask queues; the engine owns the microtask queue. This lesson makes the ordering precise, because the two queues drain on completely different cadences.
- Macrotasks (the spec calls them simply tasks) — exactly one runs per loop turn. Sources:
setTimeout/setIntervalcallbacks, I/O completion callbacks,MessageChannel/postMessagemessages, fired DOM events, parsed HTML chunks. After running one, the loop does not immediately run the next macrotask. - Microtasks — the entire queue is drained after each macrotask, and again whenever the JavaScript call stack empties. Sources:
Promise.then/.catch/.finallyreactions,queueMicrotaskjobs,awaitcontinuations,MutationObservercallbacks.
The asymmetry is the whole point. Macrotasks are rationed — one per turn — so the loop can render and handle input between them. Microtasks are exhaustive — drained to empty — so a coherent unit of async follow-up (a promise chain) completes atomically before anything else happens. The browser overview (browser/01-event-loop/04-microtask-starvation) shows the failure mode at runtime depth; here we tie it to the queue mechanics.
The canonical ordering example
console.log("1: sync start");
setTimeout(() => console.log("4: macrotask (setTimeout)"), 0);
Promise.resolve()
.then(() => console.log("3a: microtask one"))
.then(() => console.log("3b: microtask two"));
queueMicrotask(() => console.log("3c: queueMicrotask"));
console.log("2: sync end");
// Output: 1 → 2 → 3a → 3c → 3b → 4Walk it precisely. The synchronous script is the current macrotask. It runs to completion first: 1, then 2. Along the way it scheduled a macrotask (the setTimeout) and microtasks (the .then and the queueMicrotask). When the script’s stack empties, the engine drains the microtask queue in FIFO order: the first .then (3a) and the queueMicrotask (3c) were enqueued during the sync run, so they go first; 3a’s handler returns, which now settles the chained promise and enqueues 3b — appended to the same drain — so 3b runs before the drain ends. Only when the microtask queue is finally empty does the host pick the next macrotask: 4.
- Macrotasks run per loop turn
- exactly 1
- Microtasks run per checkpoint
- all, to empty
- Drain order within a queue
- FIFO
- Render can interleave between
- macrotasks only
- queueMicrotask vs Promise.then
- same queue
- Node: process.nextTick vs Promise
- nextTick first
Why a microtask that enqueues a microtask is dangerous
Because the microtask checkpoint drains to empty, a microtask that enqueues another microtask before returning is processed in the same drain, not the next one. There is no “next turn” boundary to escape to. Repeat it and the queue never empties:
function spin() {
Promise.resolve().then(spin); // re-arms inside the same checkpoint
}
spin(); // freezes: the checkpoint never completes, the engine never returnsThis is microtask starvation. The host never gets the thread back (the engine is stuck inside PerformMicrotaskCheckpoint from lesson 1), so no macrotask runs, no frame paints, no input is handled. Contrast with a macrotask self-loop — setTimeout(spin, 0) — which re-arms on a host queue, so the engine returns between iterations and the page stays responsive (just busy). The cure for starvation is always to insert a macrotask-level yield into the chain.
Node specifics: process.nextTick and per-phase draining
When you’re reading a Node codebase and process.nextTick fires before your Promise.resolve().then, it’s not a bug or a quirk — it’s an intentional second pre-promise queue. Node complicates the picture with two extra rules. First, process.nextTick callbacks run in a queue that is separate from and drained before the Promise microtask queue. So in Node, process.nextTick always beats Promise.resolve().then. Second, Node’s loop runs in phases (timers → pending callbacks → poll → check → close), and historically Node drained microtasks between phases rather than after every single callback — though since Node 11 it drains microtasks after each individual macrotask callback, bringing it closer to browser semantics.
// In Node:
setTimeout(() => console.log("timeout"), 0); // timers phase (macrotask)
setImmediate(() => console.log("immediate")); // check phase (macrotask)
Promise.resolve().then(() => console.log("promise")); // microtask
process.nextTick(() => console.log("nextTick")); // nextTick queue — first
// Order: nextTick → promise → (timeout|immediate, order between these
// two is not guaranteed from the main module)The practical senior takeaway: never rely on setTimeout vs setImmediate ordering from the top level, but do rely on process.nextTick running before promise microtasks. And beware: process.nextTick has the same starvation hazard as a microtask loop — a recursive nextTick starves the phase loop just as a recursive .then starves the browser.
Inside a `setTimeout` callback you run `Promise.resolve().then(work)` and also schedule another `setTimeout(other, 0)`. In what order do `work` and `other` run?
In Node, you schedule `process.nextTick(a)` and `Promise.resolve().then(b)` from the same synchronous block. Which runs first, and why?
Order the output of the canonical example: a sync script that schedules one setTimeout, a two-link .then chain, and one queueMicrotask. Drag the log lines into the order they print.
- 1 1: sync start (synchronous, current macrotask)
- 2 2: sync end (synchronous, still the same macrotask)
- 3 3a: first .then handler (microtask, enqueued during sync)
- 4 3c: queueMicrotask (microtask, enqueued during sync)
- 5 3b: second .then handler (microtask, enqueued by 3a in the same drain)
- 6 4: setTimeout callback (next macrotask, after the queue drains)
▸Edge cases
await continuations are microtasks too, so they obey the same exhaustive-drain rule. A function that awaits in a loop will interleave its resumptions with every other pending microtask before any macrotask runs. This is why mixing await inside a hot synchronous-feeling loop can quietly defer a render far longer than you expect — the awaits keep the microtask queue non-empty. Lesson 04 makes the await-to-microtask mapping explicit.
- 01State the exact draining rule for macrotasks vs microtasks, and name the sources of each.
- 02Trace why `1, setTimeout(4), Promise.then(3a).then(3b), queueMicrotask(3c), 2` prints 1 2 3a 3c 3b 4.
- 03How does Node's ordering differ from the browser, and what is the practical rule?
Macrotasks and microtasks drain on opposite cadences. Exactly one macrotask runs per loop turn — setTimeout, I/O completions, message events, DOM events — after which the loop can render and handle input. The entire microtask queue, by contrast, drains FIFO to empty after each macrotask and whenever the JS stack empties — Promise reactions, queueMicrotask, await continuations, MutationObserver. Because the drain is exhaustive, a microtask that enqueues another microtask runs in the same drain, not a later turn; repeated, this is microtask starvation, which freezes the page because the engine never finishes the checkpoint and never returns the thread to the host. A macrotask self-loop, by contrast, returns the thread each turn and stays responsive. Node adds a process.nextTick queue drained before the Promise queue (so nextTick wins) and a phase-based loop; since Node 11 microtasks drain after every macrotask callback, close to browser behaviour. The canonical ordering example — 1 2 3a 3c 3b 4 — is the muscle memory every senior needs to reason about async races. Now when you see a tab freeze with no apparent CPU spike, ask first: is something spinning in the microtask queue and never returning the thread to the host?
Practice
Start at the top. Tasks go easiest → hardest: recall a fact, apply it to a case, then a senior-level stretch. Open one, attempt it, then reveal.
appears again in184
- 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
- The event loop: one thread, three queuesjunior
- Tasks, microtasks, and scheduler.yield()middle
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- The render pipeline: six stages from bytes to pixelsjunior
- Stage costs and the renderer process modelmiddle
- Invalidation, dirty bits, and containmiddle
- Compositor layers: promotion, overlap, and GPU memorymiddle
- DevTools flame strip and the frame lifecyclemiddle
- Layout thrash: forced synchronous layoutsenior
- BeginMainFrame, compositor-driven animations, and GPU memorysenior
- Production observability: LoAF, INP, and the full attack surfacesenior
- What V8 is and why performance varies 100×junior
- V8''''s four-tier JIT pipeline and profile-guided tieringmiddle
- Hidden classes, transition trees, and memory layoutmiddle
- Inline caches, IC states, and deoptimizationmiddle
- Orinoco GC: parallel scavenger, concurrent marking, and write barriersmiddle
- TurboFan''''s speculative engine and the deopt-loop trapsenior
- V8 in production: isolates, pointer compression, and real failuressenior
- Service worker lifecycle and cache strategiesmiddle
- Service worker edge cases: version skew, durability, and navigation trapssenior
- What the reconciler does: render vs commitjunior
- The fiber object and the double-buffer treemiddle
- Render phase purity and commit phase sub-stepsmiddle
- Reconciliation: diffing heuristics and the key trapmiddle
- Priority lanes, time-slicing, and useTransitionmiddle
- Bailout, memoisation, and tearingsenior
- React Profiler, the Compiler, and production observabilitysenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Hydration mismatch: causes, detection, and the determinism rulesenior
- RSC, per-route strategy, and production observabilitysenior
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- CLS: why layout shifts happen and how to stop themmiddle
- 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 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
Something unclear?
Ask a question about this lesson. Questions are anonymous and go straight to the author to make the lesson better.