Consider a variant of Peterson’s algorithm, where we change the unlock method to be as shown in Fig.2.17. Does the modified algorithm satisfy deadlock-freedom? What about starvation-freedom? Sketch a proof showing why it’s at is fies both properties, or display an execution where it fails.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here