The Mellor-Crummey Scott Queue Lock: A powerful concurrency technique

I plugged Algorithms for scalable synchronization on shared-memory multiprocessors (unofficial version) in the last post, and I’ll plug it again because it’s really a great read.
Things are moving pretty quickly in shared memory programming, but there are some tried-and-true techniques that are seeing more and more reuse.
John M. Mellor-Crummey and Michael L. Scott created a [...]

Filed under: shared memory on August 29th, 2009 | 9 Comments »

Fraser and Harris’ Multiple Compare and Swap

Keir Fraser and Tim Harris’ Multiple Compare and Swap packs a lot of shared memory programming techniques in a page or two of code. It’s a quick way to get a jump start on lock-free programming without trudging through a stack of papers.
That and its just a neat piece of code.
What’s an MCAS?
Compare [...]

Filed under: shared memory on July 22nd, 2009 | Comments Off