1,665 views

2 Answers

2 votes
2 votes
if there are many processes and starvation is not happen then we can not say that the processes satisfied  time bound  becoz in time bound we have information about each process that it will get exuction after some specific time(or eg: p1 get execute after p0) but if processes follow time bound then we can surely say that their is no starvation.Therfore,if  time boundation is not their among the processes then their is chance of starvation(but not necessary).
0 votes
0 votes
Now in case of Bounded Wait  .. the process is not allowed to Run because of a piece of CODE which we call as  synchronization mechanism

That is say 2 process are there P1 and P2 now we have a code which they will execute ..as a result of which P1 or P2 will enter into Critical Section. Depending on Code only ...some process will never get Access to Cirtical section ...hence we call it as Fail of Bounded Wait as one process is never able to have CS.

But in case of starvation ...there is no case or condition that process must have Shared content ...or implementation of implemented synchronization mechanism . The 2 process P1 and P2 are there which don't have common section among them ..say P1 executes and at the same time new process comes with High priority ..and such thing happens again  and  again then we can say P2 is starved.

So we can say : If process have Common section in them and we have implemented synchronization mechanism ...still a process is not able to enter into CS for a long time then we can say its BUSY WAITING IS FAILED .

While If process have no common section or code or data to access and if we don't have implemented synchronization mechanism   then also if process is not able to Run then we can say its a Starvation.

Related questions

3 votes
3 votes
0 answers
3
rahul sharma 5 asked Jan 28, 2018
330 views
Can some one give example where bounded waiting satisfies but starvation freedom is not there?I have read Bounded Wait = Starvation freedom is a false implicationPlease s...
1 votes
1 votes
3 answers
4
hacker16 asked Nov 9, 2017
1,077 views
how this solution does not satisfy bounded waiting?// initially turn = 0 while (turn != 0); turn = 1 CS turn = 0