what is starvation condition in operating system?  

Starvation condition is the situation in which a process continues to be denied a resource that it needs, even though the resource is being granted to other processes. Noticing starvation situations when they arise and treating them by preventing new processes from acquiring resources is known as Starvation detection.

Answered by saixaero at 4:19 PM on December 29, 2007

In an operating system Deadlock implies starvation, but not vice versa.

Answered by Neeraj Gogia at 3:48 PM on December 21, 2007

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.

Answered by alokgupta14 at 8:38 PM on December 20, 2007

starvation is a multitasking-related problem, where a process is perpetually denied necessary resources. Without those resources, the program can never finish its task.

Starvation is similar in effect to deadlock. Two or more programs become deadlocked together, when each of them wait for a resource occupied by another program in the same set. On the other hand, one or more programs are in starvation, when each of them is waiting for resources that are occupied by programs, that may or may not be in the same set that are starving. Moreover, in a deadlock, no program in the set changes its state. There may be a similar situation called livelock, where the processes changes their states continually, but cannot progress. Livelock is a special-case of starvation. In that sense, deadlock can also be said a special-case of starvation. Usually the problems in which programs are perpetually denied of resources are referred as deadlock problems when none of them are changing their states and each of them is waiting for resources only occupied by programs in the same set. All other such problems are referred as starvation.

Starvation is illustrated by Edsger Dijkstra's dining philosophers problem.

Answered by harish at 4:18 PM on December 20, 2007

Starvation is where the system allocates resources according to some policy such that progress is being made, however one or more processes never receive the resources they require as a result of that policy.

Answered by enviornment at 3:47 PM on December 20, 2007