Explore projects tagged 'Lock-Free Programming' for high-performance concurrent systems and non-blocking algorithms
Discover an indexed list of projects tagged lock-free-programming that implement non-blocking concurrency patterns, lock-free data structures, and atomic primitives (CAS, memory fences, atomic operations) used to build high-throughput, low-latency systems. Use the filtering UI to narrow results by language (C++, Rust, Java), benchmark performance, maturity, license, or use-case to find implementations ideal for integration, performance testing, or contribution; each entry links to source code, documentation, and benchmarks so you can evaluate memory-order semantics, algorithmic guarantees, and real-world throughput. Compare implementations, run microbenchmarks, and adopt proven wait-free algorithms, hazard-pointer and epoch-based reclamation strategies, and lock-free queues/stacks to eliminate contention and reduce latency — explore, filter, and contribute to accelerate development of scalable concurrent systems.
