SPSCQueue.h
libdill
SPSCQueue.h | libdill | |
---|---|---|
1 | 2 | |
829 | 1,658 | |
- | - | |
4.6 | 0.0 | |
4 months ago | about 1 year ago | |
C++ | C | |
MIT License | MIT License |
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).
libdill
-
Show HN: A pure C89 implementation of Go channels, with blocking selects
libmill (https://github.com/sustrik/libmill) and libdill (https://github.com/sustrik/libdill) should be similar and probably mentioned.
As far as I understand the differences between CspChan and libmill might be that libmill also implements lightweight tasks (coroutines) and everything that goes with it (IO multiplexing, async timers, etc), while CspChan uses OS threads?
-
Libdill: Structured Concurrency for C (2016)
I saw this in 2017. Unfortunately, not much activity now. https://github.com/sustrik/libdill/commits/master
Might be fun to play with, but I wouldn't rely on it. Generally, better off with libuv for existing projects or Rust for greener fields where lifetimes are checked and safe concurrency is much easier.
What are some alternatives?
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
libmill - Go-style concurrency in C
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+.
VexCL - VexCL is a C++ vector expression template library for OpenCL/CUDA/OpenMP
A C++14 library for executors - C++ library for executors
Taskflow - A General-purpose Parallel and Heterogeneous Task Programming System
C++ Actor Framework - An Open Source Implementation of the Actor Model in C++
libcds - A C++ library of Concurrent Data Structures
NCCL - Optimized primitives for collective multi-GPU communication