Operating System:

Consider the following pseudo-code routines to provide a solution to the critical section problem between two threads in a uniprocessor system. In addition to the two disadvantages of busy waiting and good for only two threads, there is a major flaw in the routines. Explain this major flaw:

Intially, turn == 0 entry (id) { while (turn !=id); } /* if not my turn, spin */ exit (id) { turn = 1 } id; /* other thread's turn*/ Note, the id is the thread id (id == 0 or 1)