In computer science, starvation is a problem related to deadlocks whereby a process may never be granted a resource that it needs and thus it is said that the process is starved. This starvation may be avoided by assigning resources on a first-come, first-served resource allocation policy.