Four queue tiers

Correct scheduling weights

Critical queue always first

Weighted scheduling for non-critical

Age-based priority boosting

Boosting uses agingBoost value

Demo runs and produces output

Aging shown in demo

Submission timestamp tracked

Default failure threshold

Default timeout value

Three named states

Initial state is CLOSED

Opens after threshold failures

Rejects calls when OPEN

Transitions to HALF_OPEN

Resets to CLOSED on success

Tests runnable

lastFailureTime tracked

EDF sort ascending by deadline

Liu & Layland bound check

Admission allows below bound

Steal threshold filter

Victims sorted heaviest first

Global queue fallback

Simulation runs and writes output

Steal logged in output

Admission rejection logged