Adaptive Radix Tree in C++
-
Updated
Apr 14, 2026 - C++
Adaptive Radix Tree in C++
C++ Concurrency Patterns
A blazingly fast™ single producer multiple consumer broadcast queue
High-performance AutoHotkey v2 library suite for real-time pipelines (Lock-Free IPC, SPSC, EMA, Telemetry, Watchdog, Raw Input...) with selftests and Gold stacks.
Splinter is a lock-free shared memory bus that puts your AI governor in the same room (or even NUMA lane) as your model and inference. It even *includes* socket-free inference sidecars with more powerful tools that teach you how to build with it. Splinter's core fits in the size of most modern CPU instruction caches (851 ELOC W/Excellent Tests)
Ultra-low-latency SPMC/MPMC pub/sub using stamped ring buffers. Formally sound with atomic-slots feature. no_std, zero-alloc hot path. Apache-2.0.
Explore the intricate world of Kernel Sequential Locks through this repository, which provides a comprehensive understanding of seqlocks, their utility, working, and applications in Linux Kernel. Dive into the how-tos and subtle nuances with provided examples!
Ultra-low-latency, header-only concurrent cache for C++20 and Windows Kernel (WDM/KMDF). Utilizes SeqLocks, tiered backoff, and NUMA-aware sharding to deliver nanosecond tail latencies with minimal (Linux) or no (Windows/Mac) dependencies.
Add a description, image, and links to the seqlock topic page so that developers can more easily learn about it.
To associate your repository with the seqlock topic, visit your repo's landing page and select "manage topics."