Explain why the fine-grained list’s add()method is linear iz able.
Explain why the optimistic and lazy locking algorithms are not subject to dead lock. Exercise 9.6.Show an execution of the optimistic algorithm in which a thread is forever attempting to delete a node.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here