Here we can delete element 18 without grabbing its lock. This is because for another thread to delete element 18, that thread must hold the lock on 11.
This comment was marked helpful 0 times.
max
In this example, a thread iterates over the linked list by placing a lock on the previous and current nodes. Every time the thread wants to moves to the next, it places a lock on next node, removes the lock on the previous, and moves.
When thread 0 tries to delete element 11, it won't run into the problem of element 18 being deleted, since a thread needs the lock on the previous node before it can delete the current.
This comment was marked helpful 0 times.
bottie
Each thread only lock the prev and curr node which are currently iterating, then the unlock node can be deleted by other thread without any effect at all.
Here we can delete element 18 without grabbing its lock. This is because for another thread to delete element 18, that thread must hold the lock on 11.
This comment was marked helpful 0 times.
In this example, a thread iterates over the linked list by placing a lock on the previous and current nodes. Every time the thread wants to moves to the next, it places a lock on next node, removes the lock on the previous, and moves.
When thread 0 tries to delete element 11, it won't run into the problem of element 18 being deleted, since a thread needs the lock on the previous node before it can delete the current.
This comment was marked helpful 0 times.
Each thread only lock the prev and curr node which are currently iterating, then the unlock node can be deleted by other thread without any effect at all.
This comment was marked helpful 1 times.