CSE 451: Operating Systems—Scheduling¶
Levy, H. (2003). CSE 451: Operating Systems—Scheduling. University of Washington.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Aging Queue
- Its strength is that it converts "eventually" into a bound: it is the standard cure for the starvation that priority and shortest-job rules produce, letting a system keep serving urgent work first without abandoning the tail.
This sourceExplains that priority scheduling can starve low-priority jobs and that aging waiting jobs prevents indefinite neglect while retaining priority ordering.
- Its strength is that it converts "eventually" into a bound: it is the standard cure for the starvation that priority and shortest-job rules produce, letting a system keep serving urgent work first without abandoning the tail.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:257f88be85d0 · see in the full table