Demonstrate the correctness of Dekker’s algorithm.
a. Show that mutual exclusion is enforced. Hint: Show that when Pi enters its critical section, the following expression is true:
flag[i] and (not flag[1 – i])
b. Show that a process requiring access to its critical section will not be delayed indefinitely. Hint: Consider the following cases: (1) A single process is attempting to enter the critical section; (2) both processes are attempting to enter the critical section, and (2a) turn = 0 and flag[0] = false, and (2b) turn = 0 and flag[0] = true.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.