SPSCQueue.h Alternatives

Similar projects and alternatives to SPSCQueue.h

moodycamel

11 8,808 3.9 C++ SPSCQueue.h VS moodycamel

A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
HPX

15 2,417 9.8 C++ SPSCQueue.h VS HPX

The C++ Standard Library for Parallelism and Concurrency
WorkOS

workos.com sponsored

The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
libdill

2 1,658 0.0 C SPSCQueue.h VS libdill

Structured concurrency in C
VexCL

0 695 0.0 C++ SPSCQueue.h VS VexCL

VexCL is a C++ vector expression template library for OpenCL/CUDA/OpenMP
Taskflow

24 9,520 7.9 C++ SPSCQueue.h VS Taskflow

A General-purpose Parallel and Heterogeneous Task Programming System
libcds

1 2,471 0.0 C++ SPSCQueue.h VS libcds

A C++ library of Concurrent Data Structures
triple-buffer

4 79 6.3 Rust SPSCQueue.h VS triple-buffer

Implementation of triple buffering in Rust
InfluxDB

www.influxdata.com sponsored

Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
NCCL

3 2,808 5.8 C++ SPSCQueue.h VS NCCL

Optimized primitives for collective multi-GPU communication
Quaternion

3 628 8.7 C++ SPSCQueue.h VS Quaternion

A Qt-based IM client for Matrix
junction

1 1,365 0.0 C++ SPSCQueue.h VS junction

Concurrent data structures in C++
C++React

0 997 0.0 C++ SPSCQueue.h VS C++React

C++React: A reactive programming library for C++11.
Thrust

4 4,839 6.9 C++ SPSCQueue.h VS Thrust

Discontinued [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better SPSCQueue.h alternative or higher similarity.

Suggest an alternative to SPSCQueue.h

SPSCQueue.h reviews and mentions

Posts with mentions or reviews of SPSCQueue.h. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-05-28.

Notes on Concurrency Bugs
3 projects | news.ycombinator.com | 28 May 2022

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).