Consider the mutual exclusion protocol for two processes shown below: //Shared variables boolean cl false, c2...

Transcribed Image Text:

Consider the mutual exclusion protocol for two processes shown below: //Shared variables boolean cl false, c2 = false; int turn 1; Process Pl: initl; while(true) { //entry protocol turn = 2; c1 = true; while (c2 && turn ==2) { } critl; //exit protocol c1 = false; reml; } Process P2: init2; while(true) { //entry protocol turn 1; c2 = true; while (cl && turn == 1) { } crit2; //exit protocol c2 = false; rem2; } where init1 and init2 are non-critical initialisations, crit1 and crit2 are critical sections and rem1 and rem2 are non-critical remainders of the programs. Does the protocol satisfy the properties of Mutual Exclusion, Absence of deadlock, and Eventual Entry? If not, give an example trace that results in the property being violated and fix the algorithm using only standard C-like instructions as in the original algorithm so that it satisfies all the properties. (15 marks) Consider the mutual exclusion protocol for two processes shown below: //Shared variables boolean cl false, c2 = false; int turn 1; Process Pl: initl; while(true) { //entry protocol turn = 2; c1 = true; while (c2 && turn ==2) { } critl; //exit protocol c1 = false; reml; } Process P2: init2; while(true) { //entry protocol turn 1; c2 = true; while (cl && turn == 1) { } crit2; //exit protocol c2 = false; rem2; } where init1 and init2 are non-critical initialisations, crit1 and crit2 are critical sections and rem1 and rem2 are non-critical remainders of the programs. Does the protocol satisfy the properties of Mutual Exclusion, Absence of deadlock, and Eventual Entry? If not, give an example trace that results in the property being violated and fix the algorithm using only standard C-like instructions as in the original algorithm so that it satisfies all the properties. (15 marks)