SPSCQueue.h
libcds
SPSCQueue.h | libcds | |
---|---|---|
1 | 1 | |
829 | 2,475 | |
- | - | |
4.6 | 0.0 | |
4 months ago | 7 months ago | |
C++ | C++ | |
MIT License | Boost Software License 1.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
SPSCQueue.h
-
Notes on Concurrency Bugs
A triple buffer is a good choice if all you want is polling the latest data at any given time, and you want to avoid mutexes altogether. If you want each piece of data to be delivered exactly once, you can use a queue (bounded or "unlimited" though the latter doesn't supply backpressure which I hear causes problems). SPSC lock-free bounded queues are dead simple to write, and can be tuned for higher throughput even with contention (https://github.com/rigtorp/SPSCQueue claims to be nice, and I haven't had issues working with it aside from having to peek and pop separately, but it's C++, and not a misuse-proof API since it doesn't use the "handles" idea I talked about, and you can push/read/pop from the wrong thread). If you want the reader to poll/WaitForMultipleObjects until the queue has items, that has to be done separately from the SPSC.
And mutexes make a lot of things easier... and introduces "oops wrong mutex!" (Rust solves it) and deadlock (Rust doesn't solve it).
libcds
-
Retiring boost from my codebase
I'm also looking for replacement for concurrent containers: I have used TBB, it's good, though I would like to use the containers only. I have seen some alternatives like https://github.com/khizmax/libcds but didn't have an opportunity to try it yet.
What are some alternatives?
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
HPX - The C++ Standard Library for Parallelism and Concurrency
ck - Concurrency primitives, safe memory reclamation mechanisms and non-blocking (including lock-free) data structures designed to aid in the research, design and implementation of high performance concurrent systems developed in C99+.
libdill - Structured concurrency in C
RaftLib - The RaftLib C++ library, streaming/dataflow concurrency via C++ iostream-like operators
VexCL - VexCL is a C++ vector expression template library for OpenCL/CUDA/OpenMP
junction - Concurrent data structures in C++
Taskflow - A General-purpose Parallel and Heterogeneous Task Programming System
NCCL - Optimized primitives for collective multi-GPU communication
Thrust - [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl