Explain how in the Lock Free Skip List class a node might end up in the list at levels 0 and 2, but not at level
1. Draw pictures. Exercise 14.7.Modify the Lock Free Skip List so that the find()method snips out a sequence of marked nodes with a single compare And Set(). Explain why your implementation cannot remove a concurrently inserted unmarked node.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here