How's bounded waiting achieved here?

[shivajikobardan]

 

I understand how mutual exclusion is achieved here. But not sure how bounded waiting is achieved here.

 

P_i:
do
{
 while(turn!=i);
 critical section
 turn=j;
 remainder section
 while(1);
}

This question has also been answered here but not properly imo. So, I'm asking this again here.

https://stackoverflow.com/questions/41590276/how-does-this-code-section-maintain-bounded-waiting

A course that I purchased from Prateek Jain Academy is telling "because of progress, bounded waiting is not happening". But I'm unable to understand it.

[shivajikobardan]

http://cc.ee.ntu.edu.tw/~farn/courses/OS/slides/ch06.pdf

 

How do I write a backward refutation tree for proving mutual exclusion or anything for that matter?

[SansVarnic]

-= Topic Moved to Programming =-

[shivajikobardan]

This is not peterson's solution. This is an attempt to solve the CS problem, this doesn't solve it.