0 votes 0 votes Does this solution guarantee A) mutual exclusion, B) progress, C) bounded waiting, D) starvation-freedom, E) deadlock-freedom Operating System operating-system + – vignesh asked May 1, 2017 vignesh 669 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Prashant. commented May 1, 2017 i edited by Prashant. May 1, 2017 reply Follow Share Mutual exclusion YES Progress, No Bounded waiting, No Starvation-freedom, No Deadlock-freedom No 0 votes 0 votes vignesh commented May 1, 2017 reply Follow Share @Prashant sir why starvation-freedom is not guaranteed ?? i am not able to differentiate between starvation-freedom and bounded waiting ...can u please explain ...? 0 votes 0 votes Prashant. commented May 1, 2017 i edited by Prashant. May 1, 2017 reply Follow Share Starvation Freedom implies Deadlock Freedom. So doing contra-positive we get No Deadlock freedom implies No starvation freedom. Check Here Bounding waiting is there should be bound on number of time process go into CS before another process access it. Here two process but one process can go any no. of times in CS before Second wan to go , so No Bounded waiting here. So Bounded waiting implies starvation [ i am not confirm about it] Link 1 Link 2 Link 3 Link 4 0 votes 0 votes Kapil commented May 1, 2017 reply Follow Share BW is satisfied. Deadlock is there and Deadlock implies starvation (D -> S) hence, S' -> D' No starvation (Starvation freedom) implies no deadlock . You can have a look here :- https://gateoverflow.in/68510/synchronization-self-doubt 0 votes 0 votes Prashant. commented May 1, 2017 reply Follow Share kapil explain bounding waiting. 0 votes 0 votes Kapil commented May 1, 2017 reply Follow Share @Prashant Whenever a process P1 has a desire to enter the CS, then the number of processes that will be allowed to enter the CS after which the request of P1 to enter the CS will be entertained, let be $B$. It Means Say, $B$ is the total number of processes that will be allowed to enter the CS and after that only P1 will enter. Here, we have $B=0$, i.e no process can enter the CS hence BW is satisfied. BW and Deadlock are independent of each other . 0 votes 0 votes Prashant. commented May 1, 2017 reply Follow Share What if P0 always get CS and not P1. 0 votes 0 votes Kapil commented May 1, 2017 reply Follow Share Then, in that case if we have designed synch. mechanism like that ,then BW is not satisfied. u r right . 0 votes 0 votes Please log in or register to add a comment.