Projects by Tag: Lock-Free Data Structure Implementations for High-Performance Concurrent Systems
Explore projects tagged lock-free-data-structure to find non-blocking, concurrent data structure implementations—queues, stacks, hash tables, priority queues and more—optimized for low-latency, high-throughput systems. This curated list surfaces projects that leverage CAS and atomic primitives, wait-free and lock-free algorithms, memory reclamation techniques (hazard pointers, epoch-based reclamation), and language-specific optimizations in C++, Rust, Java, and Go; each entry includes source links, benchmarks, and integration notes to help you evaluate performance and safety trade-offs. Filter by language, algorithm class, or performance profile, review code and benchmark results, and fork, contribute, or adopt proven implementations to accelerate your concurrent system development.
