An efficient and practical queueing for fast core-to-core communication
During summer 2012, Junchang Wang, Kai Zhang and Bei Hua from University of Science and Technology of China (USTC), and Xinan Tang from Intel Compiler Lab (Santa Clara, USA) published the B-Queue algorithm.
The original source code is available in Sourceforge: http://sourceforge.net/projects/bqueue/
B-Queue aims to be faster than FastForward and MCRingBuffer, two other single-producer-single-consumer concurrent lock-free FIFOs (abbreviated as CLF).
- Draft publication is available (final version costs about $40 / 35€ / £30)
- http://psy-lob-saw.blogspot.com/2013/11/spsc-iv-look-at-bqueue.html
- Liberty Queue, another interresting single-producer/single-consumer (SP/SC) concurrent lock-free (CLF) queue
- The SP/SC CLF queue of FastFlow framework (overview)
- boost::lockfree
- LMAX Disruptor and Disruptor--
- https://github.com/cameron314/concurrentqueue
- https://github.com/rlu-sync/rlu
- https://github.com/concurrencykit/ck
- http://stackoverflow.com/questions/8400114/what-is-the-reason-why-high-level-abstractions-that-use-lock-free-programming-de