Q11,a
NATMarks unknownConsider the following scheme for implementing a critical section in a situation with three processes and . Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] := false; while turn != i do skip; flag [i] := true; end; k: if flag [k] then begin flag [i] := false, while turn != i do skip; flag [i] := true end end critical section if turn = i then turn := j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
Sign in to save attempts.
Loading…