PDA vs QPA — interactive explorer

Random EDF task sets via UUniFast. Processor Demand Analysis (forward enumeration of absolute deadlines) vs Zhang-Burns QPA (backward sweep). Both are exact; the question is how many evaluations of h(t) each needs.

seed: 1
U
—
L_a
—
L_b
—
L
—
verdict
—
speedup
—

PDA testing points (0)

QPA trace (0 evals)