# max0x7ba/atomic_queue

C++14 concurrent lock-free low-latency queue.

Repository: https://github.com/max0x7ba/atomic_queue
Canonical: https://ross.abutalabs.com/products/atomic_queue
Homepage: https://max0x7ba.github.io/atomic_queue/html/benchmarks.html
Language: C++
License: MIT
License Family: permissive
Topics: lock-free, lockfree, atomics, atomic, queue, multithreading, multi-threading, data-structures, datastructures, atomic-queues, ring-buffer-array, lockless, circular-queue, benchmarks, low-latency, high-performance, circle-buffer, concurrent
Last push: 2026-08-26T20:36:54+00:00

## Health v2 (maintenance only)
Score: 77/100 (v2, computed 2026-09-03T02:20:16.233290+00:00)
- activity 99, release rhythm 35, longevity 100
- inputs: {"age_days": 2905, "days_push": 7, "days_rel": null, "gap_med": null, "n_releases_24m": 0}
- flags: no_releases
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 1893, forks 219 (observed 2026-08-28T04:05:50.617823+00:00)

## What it is
A C++14 header-only library providing multiple-producer multiple-consumer lock-free queues built on circular buffers and std::atomic. It is designed to minimize the latency between a producer thread pushing an element and a consumer thread popping it.

## Use cases
- pass messages between threads with minimal latency
- replace mutex-protected std::queue in a multithreaded pipeline
- build a low-latency producer-consumer work queue
- implement a lock-free SPSC or MPMC ring buffer
- benchmark queue implementations for throughput and latency
- share data between threads in a high-frequency trading or HFT system

## When to choose
- you need the lowest possible inter-thread message passing latency
- you want a lightweight header-only C++14 dependency
- you need MPMC or SPSC queues with bounded capacity and no allocations at runtime
- throughput and latency benchmarks matter for your workload

## When to avoid
- you need unbounded queues that grow dynamically
- you require batching or blocking semantics with wait/notify primitives
- your platform lacks std::atomic support or you need C++11 compatibility
- you need cross-process rather than cross-thread communication

## Facets
- artifact type: library
- maturity: stable
- function: concurrency, benchmarking
- domain: developer-tools, performance
- platform: windows, cpp, cross-platform
- tags: lock-free, queue, low-latency, ring-buffer, multi-producer-multi-consumer, header-only, atomics, algorithms, linux, macos

## Member repositories
- max0x7ba/atomic_queue (main) score 77

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:05:50.617823+00:00.
- Health v2: computed from the inputs above; adoption is never an input.
- Inferred fields (summary, facets, guidance): AI-extracted, prompt v1, taxonomy v1, on 2026-08-30T03:12:55.784202+00:00, confidence not recorded.
  - readme: https://github.com/max0x7ba/atomic_queue (fetched 2026-08-28T04:05:50.617823+00:00, sha eceb32854e1b)
  - homepage: https://max0x7ba.github.io/atomic_queue/html/benchmarks.html (fetched 2026-08-29T10:51:55.175043+00:00, sha 1c8a473b7078)
- Data as of 2026-08-30T08:39:29.467469+00:00.