Multi-Level Feedback Queue¶
Arpaci-Dusseau, R. H., & Arpaci-Dusseau, A. C. (2018). Multi-Level Feedback Queue.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Bounded Priority Rotation
- Its strength is that it is cheap, local, needs no central coordinator, and converts a symmetric stalemate into guaranteed progress with a fairness guarantee a static priority lacks — the rotation acts as a starvation guard in the same spirit as priority aging in a scheduler.
This sourceShows that periodic priority boosts plus round-robin service prevent starvation and guarantee eventual progress for lower-priority work.
- Its strength is that it is cheap, local, needs no central coordinator, and converts a symmetric stalemate into guaranteed progress with a fairness guarantee a static priority lacks — the rotation acts as a starvation guard in the same spirit as priority aging in a scheduler.
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:f5c1dec2d7c0 · see in the full table