Handle overload and fair scheduling: request walkthrough and lab
Part of the Staff AI System Design course. Everything runs in your browser and makes no network requests. Every figure is illustrative.
Request walkthrough
- Responsible component
- Input
- Output and state
- Possible failure
Lab: A Noisy Tenant in a Fixed Service Window
Which tenant gets the fixed service?
Finite time-zero burst; equal one-second jobs; 12 queued jobs per tenant; A/B/C insertion order; B/C offer six each; WRR weights 2:1:1. Retry copies use unsafe fresh keys. No distributed or variable-token fairness claim.