self doubt

Question

Peterson’s Solution meets all three requirements; solves the critical section problem for two processes

 Can be extended to n processes by pairwise mutual exclusion – too costly

what does pairwise mutual exclusion meant here?

ref:- http://cse.iitkgp.ac.in/~agupta/OS/IPC.pdf page#20

Comments

simply comparing every two processes and allow only one finally.

for understanding bakery algorithm, you may see

https://gateoverflow.in/228832/process-synchronisation-self-doubt-bakery-algorithms-code

https://gateoverflow.in/229010/%23gate2016-usergate-barrier-synchronisation-question-doubt

https://gateoverflow.in/229364/%23c-programming-how-this-for-loop-is-working

---

@Shaik Masthan

thanks for the links.

so, you are saying that n process peterson's solution and bakery algorithm are the same thing?

---

you are saying that n process peterson's solution and bakery algorithm are the same thing?

no... i hope in n-process Peterson's solution, in the while loop they check the condition of flag and turn variable of every process...

So, they simply came to the bakery algo with small modifications

---

@Shaik Masthan

ok thanks