1 votes 1 votes https://gateoverflow.in/109195/made-easy-mock-test https://gateoverflow.in/108500/made-easy-test-series https://gateoverflow.in/112717/synchronisation https://gateoverflow.in/107206/made-easy-mock-test-1 https://gateoverflow.in/102011/made-easy All these have same question In this it satisfies both mutual exclusion and progress but what about bounded waiting I dont think it is satisfied Please can someone answer this with explanation my doubt is if P1(waits for s2) P2(waits for s3) P3(executes CS) then after P3 exiting CS P2 enters into CS Now if P3 again wants to enter then P3 (acquires S2 before P1 acquires) Then bounded wait may not satisfied please explain will this happen or not Operating System process-synchronization operating-system + – student2018 asked Apr 13, 2017 • edited Apr 13, 2017 by student2018 student2018 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes plz let me know if i m wrong... akash.dinkar12 answered Apr 13, 2017 akash.dinkar12 comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments student2018 commented Apr 13, 2017 reply Follow Share ok thank you i missed it 0 votes 0 votes akash.dinkar12 commented Apr 13, 2017 reply Follow Share always welcome!!!!! 0 votes 0 votes balaeinstein commented Jun 25, 2017 reply Follow Share https://gateoverflow.in/108500/made-easy-test-series . In this link they have clearly specified that the synchronization mechanism is "used" by the processes P1,P2,P3. The given code of synchronization mechanism is not the entire process. Any process can use this synchronization mechanism at any location to access the critical section any number of times they are in need of. In this scenario , let us assume that the process P1 can continuously use this synchronization mechanism several times in its code without letting the interested processes P2 AND P3 to access the critical section. So there is no bounded waiting. you are saying that there is no loop so bounded waiting is satisfied which is not true. Because the code is just a synchronization mechanism and it is not the entire process and this code can be used by a process any number of times in its actual code to access the critical section. 1 votes 1 votes Please log in or register to add a comment.