Saturday, November 15, 2014

Linked Lists: Locking, Lock-Free, and Beyond

The Art of Multiprocessor Programming by Maurice Herlihy and Nir Shavit is undoubtedly the textbook on concurrency. As it so happens, there is a very nice set of accompanying slides which talk about linked lists, locks, lock-free and other stuff.
This presentation is full of little pearls, and it is very worth the time, at least to watch in full screen:
http://www.google.ch/url?sa=t&rct=j&q=&esrc=s&source=web&cd=7&cad=rja&uact=8&ved=0CFYQFjAG&url=http%3A%2F%2Fbooksite.elsevier.com%2F9780123705914%2FLecture%2520Slides%2F08~Chapter_09.ppt&ei=ZFE5U9vCJYGHtQas04CYCg&usg=AFQjCNFKhTii5mLgxHIlBegraRU2ePGlcw&bvm=bv.63808443,d.Yms




No comments:

Post a Comment