Features of Dekker’s

• flag[n], n = {0 ,1} indicates desire to enter CS by process n.

• turn = n indicates that it is process n’s turn.

• Process 0

• ( flag[0] = = 1) && (NOT flag[1]) enter CS.

• (flag[0] ==1) && (flag[1] == 1) && (turn == 1) then wait for turn == 0 after making flag[0] = 0 (letting the other one go)

• Go through Fig.5.5

Previous slide

Next slide

Back to first slide

View graphic version