18. The following attempt to implement critical sections is similar to the program in Figure 8.26 except for the order of the statements in the entry section:

*

(a) Does the algorithm guarantee mutual exclusion? If not, show an execution sequence that lets both processes run in their critical sections simultaneously.

(b) Does the algorithm prevent deadlock? If not, show an execution sequence that deadlocks P1 and P2.

Transcribed Image Text:

Process P1 do while (enter2) ; //nothing enter1 = TRUE critical section enter1 = FALSE; remainder section while (!done 1); Process P2 do while (enter1) ;//nothing enter2 = TRUE critical section enter2 = FALSE; remainder section while (!done2);