ALL LESSONSWEEK 38MONDAY

UNDERSTAND · NODE + BACKEND

Worker threads

One process under load30–60 MINUTESCORE + PRACTICAL
01

GROUND

Problem

What becomes confusing, fragile, or impossible without understanding worker threads? This lesson answers that through explanation, a worked example, two runnable exercises, and a reference solution. No teacher-supplied worksheet is required.

Node applied JavaScript’s event-driven model to servers and command-line programs, pairing a single process with nonblocking I/O.
02

LEARN

Concept explanation

Worker threads belongs to “One process under load”. Capacity ends where CPU, memory, descriptors, event-loop delay, or dependencies saturate.

For worker threads, trace concrete input, state transition, output, and failure through a server-side runtime boundary involving process lifecycle, filesystem or network I/O, streams, and capacity.

One process owns an event loop, module graph, heap, handles, streams, signals, and explicit boundaries to the OS and network. Apply that model to supplied normal, boundary, and failure cases; each case below names its input and expected evidence.

Observable

Evidence produced by the worker threads experiment: output, state, trace, bytes, timing, or diagnostics.

Invariant

Condition that must remain true while inputs or implementation of worker threads change.

Boundary

Point where worker threads crosses ownership, representation, time, process, network, or trust.

Example bank

Compare normal, boundary, failure, and cross-layer cases. Predict each observation before revealing the explanation.

Baseline · one variable

SETUPLoad-test one-process server and record latency percentiles, throughput, handles, CPU, memory.

OBSERVEReport names first bottleneck from evidence and distinguishes worker/child-process trade-offs.

WHY IT MATTERSThis isolates the normal contract of worker threads; preserve its raw evidence as the control for every later comparison.

Boundary · same contract, harder input

SETUPIncrease concurrency until first measured knee.

OBSERVERecord what remains invariant and the first representation, owner, size, or timing value that changes in Node inspector · curl · SQLite CLI · process tools.

WHY IT MATTERSA boundary example is useful only when one named dimension changes and everything else stays comparable.

Failure · evidence before repair

SETUPSend termination under load and verify graceful drain timeout.

OBSERVECapture the first divergence from the baseline, including exact input, diagnostic, state, and recovery result. Expected recovery: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.

WHY IT MATTERSThe diagnostic is part of the interface. Repair the proven cause, not the most visible symptom.

Cross-layer · follow ownership

SETUPTrace worker threads one layer below its usual abstraction through a server-side runtime boundary involving process lifecycle, filesystem or network I/O, streams, and capacity.

OBSERVEUse Node inspector, active handles, process signals, curl, CPU profiles, heap snapshots, and OS process tools.

WHY IT MATTERSThe lower layer is earned when it explains evidence the current layer cannot. Otherwise keep worker threads at the simpler boundary.

03

SEE

Worked example

Start from supplied server.mjs. Focus: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.

  1. Run: node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/
  2. Save baseline evidence. Use Node inspector, active handles, process signals, curl, CPU profiles, heap snapshots, and OS process tools.
  3. Boundary case: Increase concurrency until first measured knee.
  4. Failure case: Send termination under load and verify graceful drain timeout.
RESULT
Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs. Starter-level baseline: Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
04

START HERE

Starter material

PREREQUISITESNode.js 22+ and curl. Verify with node --version and curl --version.

ONE-TIME SETUPmkdir reforging-node && cd reforging-node

Create server.mjs, paste this exact content, then run the command below.

import { createServer } from "node:http";

const server = createServer((request, response) => {
  const body = JSON.stringify({ topic: "worker threads", method: request.method });
  response.writeHead(200, { "content-type": "application/json", "content-length": Buffer.byteLength(body) });
  response.end(body);
});

server.listen(3000, "127.0.0.1", () => console.log("http://127.0.0.1:3000"));
RUNnode server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/

STOP / CLEANUPSupplied command traps shell exit and stops server. If running server alone, press Ctrl+C.

05

DO WITH GUIDANCE

Guided exercise

Observe one rule: worker threads

  1. Normal case: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
  2. Write predicted evidence from this named case before running starter.
  3. Change one input while holding environment constant.
  4. Run exact normal case. Save commands, inputs, outputs, and diagnostics in notebook.
  5. Explain changed evidence using lesson mental model in no more than five sentences.
Concrete guided solution
  1. Copy the supplied server.mjs unchanged and run: node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/
  2. Write this prediction before inspecting output: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
  3. Perform only the named normal case: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
  4. Save the raw output, then annotate input → transition → evidence. Use Node inspector · curl · SQLite CLI · process tools to confirm the transition rather than inferring it.
  5. Compare prediction with evidence; if they differ, keep both and write the rule that explains the difference. Reference baseline: Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
06

DO ALONE

Independent exercise

Find the boundary: worker threads

  1. Create second case from blank file: Increase concurrency until first measured knee.
  2. Then create controlled failure: Send termination under load and verify graceful drain timeout.
  3. Use Node inspector · curl · SQLite CLI · process tools to prove behavior, then repair controlled failure.
  4. Compare result against supplied acceptance checks and reference approach before marking complete.
Concrete independent solution
  1. Duplicate the starter into a clean comparison case; change only this boundary: Increase concurrency until first measured knee.
  2. Save its evidence beside the baseline and identify the first changed value. Use Node inspector, active handles, process signals, curl, CPU profiles, heap snapshots, and OS process tools.
  3. Create the exact controlled failure: Send termination under load and verify graceful drain timeout.
  4. Reproduce baseline exactly: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
  5. Write observation table with columns input, state transition, output, and failure for worker threads.
  6. Run boundary case unchanged: Increase concurrency until first measured knee.
  7. Trigger controlled failure: Send termination under load and verify graceful drain timeout.
  8. Compare evidence with reference outcome: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
  9. Rerun baseline, boundary, and repaired failure together. Accept only if all reproduce: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
07

COMPARE

Expected result

  • Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
  • Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
  • Controlled worker threads failure produces captured evidence; repair restores stated invariant without hiding error.
08

PROVE

Acceptance checks

Lesson is complete only when every check is true. Each check is stored locally and travels with your JSON backup.

0/5 complete · saved on this device

09

UNSTICK

Hints

Reveal hints
  1. Start with supplied normal case exactly as written: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
  2. For boundary case, change only named dimension: Increase concurrency until first measured knee.
  3. If result is confusing, diff raw inputs and evidence before editing implementation.
  4. If tool shows nothing useful, move observation one boundary lower: representation, runtime, OS, or network.
10

VERIFY

Solution

Attempt both exercises before opening reference approach.

Reveal reference solution
  1. Run unmodified starter and preserve baseline evidence: Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
  2. Reproduce baseline exactly: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
  3. Write observation table with columns input, state transition, output, and failure for worker threads.
  4. Run boundary case unchanged: Increase concurrency until first measured knee.
  5. Trigger controlled failure: Send termination under load and verify graceful drain timeout.
  6. Compare evidence with reference outcome: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
11

PREDICT · INSPECT · BREAK · DEBUG · MEASURE

Interrogate reality

Prediction: write expected output, state transition, ordering, and failure evidence before running either exercise.

Inspection: Use Node inspector, process reports, CPU profiles, heap snapshots, active handles, logs, curl, and OS process tools.

Measurement: Measure event-loop delay, latency percentiles, throughput, memory, file descriptors, query time, and saturation.

INSPECT

Capture raw evidence before explaining.

BREAK

Change one assumption and force controlled failure.

DEBUG

Find cause with Node inspector · curl · SQLite CLI · process tools before editing fix.

TOOL DRILL · keyboard only · record one retrievable command or shortcut
12

MASTERY + FRONTIER + BOUNDARY

Own the knowledge

TEACH

Explain worker threads at beginner, intermediate, and senior depth.

REBUILD

Recreate smallest useful example from blank file without notes or AI.

RETRIEVE

Schedule recall for day 1, 7, 30, and 90.

Creative frontier lab

Try first without opening the solutions. The constraints invite invention; the reference gives one concrete direction, never the only valid answer.

Constraint inversion

Re-solve worker threads by removing the most convenient abstraction. build the useful vertical slice in one process before adding infrastructure.

CONSTRAINTKeep the same inputs, observable result, and failure evidence; change the means, not the contract.

ORIGINAL IDEATurn subtraction into a design tool: the missing abstraction should reveal which responsibility it used to hide.

Reveal frontier solution
  1. Freeze the contract as three fixtures: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory. / Increase concurrency until first measured knee. / Send termination under load and verify graceful drain timeout.
  2. List every convenience used by the starter; remove the highest-level one while preserving node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/.
  3. Implement the smallest replacement using build the useful vertical slice in one process before adding infrastructure.
  4. Run all fixtures and compare raw evidence. Keep the simpler version unless the removed abstraction has a demonstrated benefit.
Representation x-ray

Build an explanation artifact for worker threads: expose active handles, stream pressure, signals, status, logs, and resource cleanup.

CONSTRAINTA peer must be able to locate the first divergence without reading implementation code.

ORIGINAL IDEATreat the explanation itself as a product: make invisible transitions visible, replayable, and diffable.

Reveal frontier solution
  1. Create one row or timestamped event for each transition in: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
  2. For every row record input, representation, owner, operation, output, and tool evidence from Node inspector · curl · SQLite CLI · process tools.
  3. Replay Increase concurrency until first measured knee.; highlight only changed rows.
  4. Replay Send termination under load and verify graceful drain timeout.; stop at the first divergent row and attach its recovery action.
Adversarial remix

Combine the boundary and failure into a new user-visible scenario for worker threads. make shutdown, malformed input, and partial I/O first-class demo modes.

CONSTRAINTDo not merely add more input. Invent a recovery interaction, alternate representation, or self-checking behavior.

ORIGINAL IDEAMake the system teach its own limits: the artifact should expose the invariant and offer a safe next action when it breaks.

Reveal frontier solution
  1. Combine these two pressures without changing them: Increase concurrency until first measured knee. AND Send termination under load and verify graceful drain timeout.
  2. Name the invariant that must survive and the user-visible evidence when it cannot: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
  3. Implement this original direction: make shutdown, malformed input, and partial I/O first-class demo modes.
  4. Demonstrate baseline, combined failure, recovery, then baseline again; save the sequence as a regression fixture.

Capability frontier

Push worker threads until another layer becomes justified. Record one robust technique, one contextual trade-off, and one labeled hack or historical curiosity.

CORE · PRACTICAL · CONTEXTUAL · HACK · FRAGILE · HISTORICAL · GOLF

Boundary

One process eventually hits CPU, memory, availability, deployment, or organizational limits—but those limits must be measured.

If this vanished tomorrow…

Use CGI-style programs, another runtime, static files, shell tools, or serverless request handlers.

Why next layer is earned

WASM and embedded data are earned when measured work needs a low-level boundary or a relational local model.