Consider two cooperating processes P5 and P6. Suppose that, at any time, P6 want toenter its critical section. Write an algorithm using Peterson’s solution which shows thatP6 can finally enter into its criticalsection. Consider the turn value for P5 to be 10 andP6 to be 12.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here