Explain how the system can deal with the starvation problem, Operating System

Q. Can a system detect that some of its processes are starving? If you answer "yes," explain how it can. If you answer "no," explain how the system can deal with the starvation problem.

Answer: Starvation is a difficult topic to define as it may signify different things for different systems. For the cause of this question we will define starvation as the situation whereby a process must wait beyond a reasonable period of time-perhaps indefinitely-prior to receiving a requested resource. One way of noticing starvation would be to first identify a period of time-T-that is considered unreasonable. When a process desires a resource a timer is started. If the elapsed times go beyond T then the process is considered to be starved.

One approach for dealing with starvation would be to adopt a policy where resources are assigned only to the process that has been waiting the longest. For instance if process Pa has been waiting longer for resource X than process Pb the request from process Pb would be deferred until process Pa's request has been satisfied.

An additional strategy would be less strict than what was just mentioned. In this situation a resource might be granted to a process that has waited less than another process providing that the other process isn't starving. Nevertheless if another process is considered to be starving its request would be satisfied first.

Posted Date: 7/27/2013 5:03:02 AM | Location : United States







Related Discussions:- Explain how the system can deal with the starvation problem, Assignment Help, Ask Question on Explain how the system can deal with the starvation problem, Get Answer, Expert's Help, Explain how the system can deal with the starvation problem Discussions

Write discussion on Explain how the system can deal with the starvation problem
Your posts are moderated
Related Questions
Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Explain about deadlock prevention? In order for the occurrence of deadlock, the four conditions like mutual exclusion, hold and wait, no pre-emption and  circular wait must hap

Determine the task of the Pass II In a two-pass assembler Synthesize the target program is the task of the Pass II

What is the sequence in which resources may be utilized? Under normal mode of operation, a process may utilize a resource in the following sequence: Request: If the requ

What is bounded buffer

Define deadlock prevention. Deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pr

Q. Why is it complicated to protect a system in which users are allowed to do their own I/O? Answer: In earlier chapters we identified a distinction among kernel and user mod

#questionThe Fibonacci sequence is the series of numbers 0,1,1,2,3,5,8,… Formally, it can be expressed as: fib0 = 0 fib1 = 1 fibn = fib n-1 + fib n-2 Write a C program u

Q. Which of the subsequent programming techniques and structures are good for a demand-paged environment? Which aren't good? Describe your answers. a. Stack b. Hashed symbol

What is sector sparing is proper definition