Computer science with a focus on the theoretical. Algorithms, data structures, and LaTeX oh my!
Implementing Lock-Free Stacks and Linked Lists
Implementing Lock-free Stacks and Linked Lists : 15-418 Spring 2013
The primary difference between blocking and non-blocking algorithms is which threads are able to make progress in the code execution. In a blocking model, a single thread is allowed to prevent all other threads from making any progress. There is no guarantee that this single thread is making progress itself or that it will ever stop blocking other threads.
courses.cs.cmu.edu
I'm slowly working my way through this, I don't have any experience with lock-free concurrent structures.



