https://en.wikipedia.org/wiki/Starvation_(computer_science)
In computer science, starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work.^[1]
Starvation may be caused by errors in a scheduling or mutual exclusion algorithm, but can also be caused by resource leaks, and can be intentionally caused via a denial-of-service attack such as a fork bomb.
The impossibility of starvation in a concurrent algorithm is called starvation-freedom, lockout-freedom^[2] or finite bypass,^[3] is an instance of liveness, and is one of the two requirements for any mutual exclusion algorithm (the other being correctness).
The name "finite bypass" means that any process (concurrent part) of the algorithm is bypassed at most a finite number times before being allowed access to the shared resource.