Algorithm 1

• Shared variables:

1. int turn;
2. initially turn = 0
3. turn - i Þ Pi can enter its critical section

• Process Pi

  do {

  while (turn != i) ;

  critical section

  turn = j;

  reminder section

  } while (1);

• Satisfies mutual exclusion, but not progress