Resource Starvation
Updated 2026-08-05
INTRODUCTION
English translation pending.
CORE DEFINITION
A condition in concurrent systems in which a process or thread is indefinitely denied the resources it requires by scheduling policy, priority, or lock contention, while the system as a whole continues to run. Unlike deadlock, no circular wait exists, so the blocked task is not part of a cycle and the system is not frozen. The core claim is that progress for the whole does not imply progress for every part. The qualification is that starvation is a liveness problem and must be addressed by fairness mechanisms rather than by adding capacity alone.
SCAFFOLDING EFFECT
Reduce cognitive load
- Use Starvation Scan: Identify tasks that are always deprioritized and never actually execute. - Use Fairness Design: Use aging, fair queues, or priority inheritance so every task eventually runs. - Use Reserve Bandwidth: Allocate guaranteed capacity to low-priority work such as maintenance and health.
Anchor fast decisions
Scheduling policies that always favor the highest-priority ready task leave lower-priority work permanently unselected whenever higher-priority work is available. If high-priority work arrives continuously, the lower task never runs, even though the system is not blocked and no cycle exists. Because the failure is an absence of progress rather than a stall, it is invisible in throughput metrics until the starved function collapses.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Resource_starvationverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS