0 votes 0 votes When BW isn't satisfied , it imply that process will wait for indefinite period of time , so obviously we will have starvation , so how come they both are not related to each other ? Operating System bounded-waiting operating-system + – radha gogia asked Aug 23, 2018 radha gogia 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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). Tushar Garg answered Aug 23, 2018 Tushar Garg comment Share Follow See all 0 reply Please log in or register to add a comment.
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. SHUBHAM SHASTRI answered Aug 23, 2018 SHUBHAM SHASTRI comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments SHUBHAM SHASTRI commented Aug 23, 2018 reply Follow Share consider the case of lock variables ... Say we have P1 and P2 ..we know that in case of LOCK variables bounded wait fails ... it actually referces that if process got critical section then we must put bound in that process to enter into CS Sap P1 enters into CS ..now 2nd time Bounded wait should give prefrence to P2 but as bounded wait is failed P1 can get CS "N" number of times ..but it doent say that every time P1 will get into CS .. what is says is ...there is no bound on P1 to access the CS. Now it may possible that P1 enters into CS 100 time and at 101 th time P2 got access into CS. so P2 has to wait but finally it got CS..so no satrvation .. But it is also possible that P1 will always execute and never let P2 to get access ..so in such cases P2 gets satrved ... SO bounded wait fails says that there is no Command on a process to enter into CS...that process may enter a huge times or it may enter very few times ...so failure of bounded wait may not always give Satrvation. 1 votes 1 votes Shaik Masthan commented Aug 23, 2018 reply Follow Share finally you are saying LOCK variable synchronizing method didn't cause starvation? it is false. a method didn't has starvation(deadlock) means " for any possible case, it didn't show starvation(deadlock)" i agree, that LOCK variable method didn't satisfy BOUNDED WAITING. 0 votes 0 votes SHUBHAM SHASTRI commented Aug 23, 2018 reply Follow Share What I want to say is , Bounded wait = equal share to all process to enter into critical section Absence of bounded wait = any process can share critical section any number of times Now,In second case it may possible that any one process execute infinite time or All may get access to CS but with no bound that is randomly ... Now in such cases if one process runs forever other will starve But it may also possible that all process can have access to cs ... So In absence of bounded wait If few process continuously access CS then starvation may occure for other processes If not then all process will have access to cs but like randomly 0 votes 0 votes Please log in or register to add a comment.