1. The first known correct software solution to the critical-section problem for two processes was developed...

    

Transcribed Image Text:

1. The first known correct software solution to the critical-section problem for two processes was developed by Dekker. The two processes, Po and P1, share the following variables: boolean flag [2]; int turn; The structure of process Pi(i==0 or 1) is shown below in Figure 1.1; the other process is Pi(j==1 or 0). Prove that algorithm satisfies all three requirements for the critical-section problem. do { flag[i]=true; While (flag[j]){ { If (turn==j) flag[i]=false; While (turn==j) } } ://do nothing flag[i]=true; //critical section turn=j; flag[i]=false; //remainder section } while(true); (6 Marks) 1. The first known correct software solution to the critical-section problem for two processes was developed by Dekker. The two processes, Po and P1, share the following variables: boolean flag [2]; int turn; The structure of process Pi(i==0 or 1) is shown below in Figure 1.1; the other process is Pi(j==1 or 0). Prove that algorithm satisfies all three requirements for the critical-section problem. do { flag[i]=true; While (flag[j]){ { If (turn==j) flag[i]=false; While (turn==j) } } ://do nothing flag[i]=true; //critical section turn=j; flag[i]=false; //remainder section } while(true); (6 Marks)