FA-243 / Runtime and resources / Member archive

A weighted scheduler releases traffic in unfair bursts · case 03

Round-robin ignores weights, while contiguous weighted blocks create avoidable short-prefix imbalance.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Weights are nonnegative integers. Starting all credits at zero, perform the stated smooth weighted round-robin update for each requested slot; lowest index wins ties. Zero-weight lanes are ineligible. Return chosen lane indices, or [] if all weights are zero or there are no slots.

Why this case matters

Models dispatch fairness for unequal-capacity workers with an explicit deterministic scheduling policy; it does not model variable job duration or claim universal latency optimality.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
two to one remains smooth	`[0, 1, 0, 1, 0, 1, 0, 1, 0]`	`[0, 1, 0, 0, 1, 0, 0, 1, 0]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.