2.5. Suppose that we switch the order of the first two statements in Peter- son's algorithm:...

Transcribed Image Text:

2.5. Suppose that we switch the order of the first two statements in Peter- son's algorithm: boolean intendToEnter0 = false, intendToEnter1 = false; int turn; // no initial value for turn is needed. while (true) { turn = 1; (1) turn = 0; intendToEnter0= true; (2) while (intendToEnter1 && (3) turn == 1) {;} turn == 0) {;} critical section (4) critical section intendToEnter0= false; (5) intendToEnterl = false; noncritical section (6) noncritical section while (true) { intendToEnter1 = true; (1) (2) while (intendToEnter0 && (3) (4) (5) (6) 800 300 } Does the modified solution guarantee mutual exclusion? Explain. If yes, does the modified solution guarantee progress and bounded waiting? Explain. 2.5. Suppose that we switch the order of the first two statements in Peter- son's algorithm: boolean intendToEnter0 = false, intendToEnter1 = false; int turn; // no initial value for turn is needed. while (true) { turn = 1; (1) turn = 0; intendToEnter0= true; (2) while (intendToEnter1 && (3) turn == 1) {;} turn == 0) {;} critical section (4) critical section intendToEnter0= false; (5) intendToEnterl = false; noncritical section (6) noncritical section while (true) { intendToEnter1 = true; (1) (2) while (intendToEnter0 && (3) (4) (5) (6) 800 300 } Does the modified solution guarantee mutual exclusion? Explain. If yes, does the modified solution guarantee progress and bounded waiting? Explain.