Tools for concurrent programming in Rust
—
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+.
A lock-free, read-optimized, concurrency primitive.
A collection of resources on wait-free and lock-free programming
C++14 concurrent lock-free low-latency queue.
C++-based high-performance parallel environment execution engine (vectorized env) for general RL environments.
A bounded single-producer single-consumer wait-free and lock-free queue written in C++11
M*LIB is a library of generic and type safe containers / data structures in pure C language (C99 / C11) for a wide collection of container (comparable to the C++ STL).
A collection of lock-free data structures written in standard C++11
Fast, lock-free shared-memory user-data cache for PHP
Lock-free SPSC FIFO ring buffer with direct access to inner data
A lock-free, eventually consistent, concurrent multi-value map.
A high-performance, thread-safe limit order book implementation written in Rust. This project provides a comprehensive order matching engine designed for low-latency trading systems, with a focus on concurrent access patterns and lock-free data structures.
Wire v9: from-scratch ultra-low-latency HFT stack in Rust and C. 24 crates: TCP/IP, AF_XDP, VFIO PCIe DMA, LMAX Disruptor, AVX2/AVX-512 SIMD, flat-array matching engine (11 cyc), HugePage slab (1.5 ns), lock-free MPMC, CME MDP 3.0 SBE, eBPF XDP risk. Zero heap allocs on the hot path. 46/46 tests pass.
Lock-free rate limiter for Java 8+: token bucket, leaky bucket, sliding window, fixed window, warm-up and a concurrency bulkhead. 无锁限流库:六种算法,单 jar 零依赖。