uniq VS SPSCQueue.h

Compare uniq vs SPSCQueue.h and see what are their differences.

uniq

A lock-free (multi reader / multi writer) circular buffered queue. (by bittnkr)

SPSCQueue.h

A bounded single-producer single-consumer wait-free and lock-free queue written in C++11 (by rigtorp)
InfluxDB - 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.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
uniq SPSCQueue.h
1 1
48 829
- -
0.0 4.6
over 1 year ago 4 months ago
C++ C++
GNU General Public License v3.0 only MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

uniq

Posts with mentions or reviews of uniq. We have used some of these posts to build our list of alternatives and similar projects.
  • Introducing UniQ
    1 project | dev.to | 21 Apr 2021
    Of these, the most valuable was a small implementation of a lock-free circular buffered queue. Which is the reason of this writings and the base of UniQ multithreading libray. hence the name, uni-queue, a single unifying queue.

SPSCQueue.h

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

What are some alternatives?

When comparing uniq and SPSCQueue.h you can also consider the following projects:

react-native-multithreading - 🧵 Fast and easy multithreading for React Native using JSI

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

xenium - A C++ library providing various concurrent data structures and reclamation schemes.

HPX - The C++ Standard Library for Parallelism and Concurrency

libcds - A C++ library of Concurrent Data Structures

libdill - Structured concurrency in C

Threadpool - Light, fast, threadpool for C++20

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

cachegrand - cachegrand - a modern data ingestion, processing and serving platform built for today's hardware

Taskflow - A General-purpose Parallel and Heterogeneous Task Programming System

NCCL - Optimized primitives for collective multi-GPU communication