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
For this exercise I wanted to give you some real-world examples of useful bash scripts. Therefore, you will write a couple of scripts that I actually use in my teaching to automate

The term thread-safe in computer programming describes that routine or portion of the program that may be called from multiple programming threads without uncalled for interactions

expalin about the design issues of network operating system

Is it probable to have a deadlock involving only one single process? Describe your answer. Answer: No This pursue directly from the hold-and-wait condition.

Explain the Spawnvp Function used in the netware Spawnvp(flags, execNmae, argv)   This function executes  similarly to spawnlp( ) except that parameters are passed as a v

FIFO is named as 'named pipes'. FIFO (first-in-first-out) is a special file which is laid to be data transient. Once data is load from named pipe, it cannot be load again. Also, da

Ask quesIn JavaScript, what is event handling tion #Minimum 100 words accepted#

What are the phases of background processing? Phases are:- Job Scheduling. Job Processing. Job Overview.

Multi-level page tables are tree-like structures to hold page tables. As an example, consider a two- level page table, again on a 32-bit architecture with 212 = 4 kbyte pages. Now,

Short term scheduling The short term scheduler as well known as the dispatcher executes most frequently and makes the fine grained decision of which process to execute next. Th