Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms (papers-we-love#395)

Presented on May 25th, 2016 in Amsterdam

http://www.meetup.com/papers-we-love-amsterdam/events/230722227/

Author: mrietveld

concurrency/README.md

@@ -15,3 +15,5 @@
     *Note: This contribution here is the focus on the rigorous semantics for x86 multiprocessor programs and an axiomatic definition of the memory model. Their definitions and proofs are backed by the [HOL](http://en.wikipedia.org/wiki/HOL_(proof_assistant))(Higher Order Logic) proof assistant.*
 
 * :scroll: [Experience with Processes and Monitors in Mesa](https://people.eecs.berkeley.edu/~brewer/cs262/Mesa.pdf)
+
+* [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf)