Question

I undertand the algo is Peterson's Solution and that it will not cause deadlocks or busy waiting. But does this solve the critical section problem in its entirety such as in the case of more than 2 processes.

Does this Scanned Documents 1.jpg w the following code. What algorithm does this implement? solve the critical section problem, defend your decision, explain in detail Revi #define FALSE O #define TRUE 1 /*number of processes / #define N 2 int turn int interested[N]; /* whose turn is it? */ 1* all values initially 0 (FALSE) */ /* process is 0 or 1 */ void enter_region(int process); { int other; /* number of the other process */ 1* the opposite of process */ /* show that you are interested */ /* set flag */ other = 1-process; interested[process] = TRUE; turn process; while (turn process && interested[other] } TRUE) /* null statement */; void leave region(int process) { interested[process] = FALSE; /* process: who is leaving * /* indicate departure from critical region */

Answer 1

Given algorithm is peterson's Algorithm ,And This will not work for more than 2 processes .
Because As code shows When process =0;
Other = 1-0 = 1;
Similarly When process = 1;
Other = 1-1 = 0.

During while loop only one process can be blocked  in loop for entering critical section,while other one executing in critical section.
Therefore This solution is 2 process solution(P0 and P1)