liveBook · Manning

Load shedding

As explained in Fast by Default

Load shedding is the deliberate rejection or dropping of lower-priority work to preserve system capacity for critical operations during overload.

Load shedding preserves capacity during overload by deliberately dropping lower-priority traffic so critical operations can continue. It protects the system as a whole, rather than merely limiting an individual client. section 4.5.4 section 4.5.6

Apply the technique by:

  • Classifying operations by importance, such as treating charge creation as critical and historical-data reads as non-critical. section 4.5.4
  • Activating shedding during incidents or traffic spikes, rejecting non-critical work before capacity for critical paths is exhausted. section 4.5.4 section 4.5.6
  • Auditing expensive endpoints and background jobs, then separating urgent work from low-priority batches and monitoring queue depth, latency, and failures. section 4.5.6

Layered API protection

Stripe combines per-user request limits and concurrent-request limits with load shedders. Under stress, non-critical historical-data requests are dropped while critical charge-creation requests retain capacity. Rate-limit state is shared through Redis, and equivalent limits run in test mode so behavior appears before production. section 4.5.4

How Fast by Default covers it

How deep it goes
Defines prioritization and overload behavior, but leaves detailed shedding implementation less developed than rate-limit state management.
Examples
Uses Stripe APIs, charge creation, historical-data reads, traffic spikes, and prioritized background jobs as concrete cases.
What it assumes
Assumes familiarity with API endpoints and service capacity while teaching how to distinguish critical work from discardable work.
What you can do after
Operate/configure load shedding by ranking operations, defining discardable work, and auditing behavior under traffic pressure.
How it connects
Connects load shedding with rate limiting, concurrent-request limits, critical paths, background processing, and graceful degradation.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Fast by Default. The section links point to the parts of the book it draws on.