0% found this document useful (0 votes)
146 views

Starvation

Starvation occurs when a process does not receive the resources it needs for a long time because the resources are allocated to other processes. Starvation can happen in a deadlock situation where multiple processes are each holding resources needed by the other processes in a cyclic waiting pattern. One way to alleviate non-preemption in deadlocks is to force a waiting process to relinquish its held resources so other processes can use them to finish. However, this risks indefinite starvation as a process may repeatedly request and release the same resources without ever gaining access.

Uploaded by

ajitbit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
146 views

Starvation

Starvation occurs when a process does not receive the resources it needs for a long time because the resources are allocated to other processes. Starvation can happen in a deadlock situation where multiple processes are each holding resources needed by the other processes in a cyclic waiting pattern. One way to alleviate non-preemption in deadlocks is to force a waiting process to relinquish its held resources so other processes can use them to finish. However, this risks indefinite starvation as a process may repeatedly request and release the same resources without ever gaining access.

Uploaded by

ajitbit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Starvation: Starvation is a resource management problem where a process does not get

the resources it needs for a long time because the resources are being allocated to other
processes.

Starvation in an OS occur in case of deadlock.

In deadlocks , the non preemption condition can be alleviated by forcing a process waiting for a resource that cannot
immediately be allocated to relinquish all of its currently held resources, so that other processes may use them to finish.
Suppose a system does allow processes to hold resources while requesting additional resources. Consider what happens
when a request cannot be satisfied. A process holds resources a second process may need in order to proceed while
second process may hold the resources needed by the first process. This is a deadlock. This strategy require that when a
process that is holding some resources is denied a request for additional resources. The process must release its held
resources and, if necessary, request them again together with additional resources. Implementation of this strategy
denies the “no-preemptive” condition effectively.
High Cost When a process release resources the process may lose all its work to that point. One serious consequence of
this strategy is the possibility of indefinite starvation (postponement). A process might be held off indefinitely as it
repeatedly requests and releases the same resources

Question : What is starvation and aging?


Answer:

Starvation:
Starvation is a resource management problem where a process does not get the resources
it needs for a long time because the resources are being allocated to other processes.

Aging:
Aging is a technique to avoid starvation in a scheduling system. It works by adding an
aging factor to the priority of each request. The aging factor must increase the request?s
priority as time passes and must ensure that a request will eventually be the highest
priority request (after it has waited long enough)

You might also like