Hi guys, Welcome to the Advanced Video Search Engine, and you are watching Gate Question on n process solution or Bakery algorithm|Gate Questions discussion part4. That video is uploaded by TechGuiders at 2021-01-20T22:55:49-08:00. We are promoting this video only for entertainment and educational purpose only. So, I hope you like & enjoy it. [sdKotrgi-xQ]
| Name | Gate Question on n process solution or Bakery algorithm|Gate Questions discussion part4 |
| Video Uploader | Video From TechGuiders |
| Upload Date | This Video Uploaded At 21-01-2021 06:55:49 |
| Video Discription | Gate Question on n process solution or Bakery algorithm|Gate Questions discussion part4 Question:Gate 2016-50 Consider the following proposed solution for the critical section problem. There are n processes : P0....Pn−1. In the code, function pmax returns an integer not smaller than any of its arguments .For all i,t[i] is initialized to zero. do { c[i]=1; t[i]= pmax (t[0],....,t[n-1])+1; c[i]=0; for every j != i in {0,....,n-1} { while (c[j]); } Critical Section; t[i]=0; Remainder Section; } while (true); #gatequestionsprocesssynchronization #processsynchronization #gatequestionsoperatingsystem #gatequestionbakeryalgorithm #gatequestionnprocesssolution #gatequestioncriticalsectionproblem sdKotrgi-xQ |
| Category | Education |
| Tags | gate cse | computer science | gate computer science | gate questions on process synchronization | gate questions on n process solution | gate question on bakery algorithm | operating system gate questions | gate questions | operating sysytem | gate operating system | gate 2021 | lamports bakery | lamports bakery algorithm | lamports bakery algorithm in operating system | n process solution for critical section problem | gate questions critical section |
