Concurrent Data Structures
High-performance C++20 concurrency library: a lock-free wait-free queue, a fine-grained concurrent hash map, and a work-stealing thread pool - plus the Eraser lockset algorithm for dynamic data race detection.
The problem
Shared-state concurrency usually buys safety with locks and contention; this library builds the structures that scale across cores instead - lock-free and wait-free where that wins, fine-grained locking where it does not.
Under the hood
- Core Library: C++20 header-only concurrent primitives
- Lock-Free Queue: Wait-free enqueue/dequeue with atomics
- Concurrent Hash Map: Fine-grained locking, high read/write throughput
- Thread Pool: Work-stealing thread pool
- ImGui Monitor: Real-time visualization and metrics
- Benchmarks: Performance benchmarking suite
- Google Test: Comprehensive test coverage
Outcome
Three concurrent structures ship as header-only C++20 with zero runtime dependencies, building clean on GCC 10+, Clang 12+ and MSVC 2019+, covered by 59 GoogleTest cases and an ImGui monitor that graphs throughput, latency and queue depth while the benchmarks run. Wait-free queue operations and a work-stealing thread pool hold latency under a microsecond. Alongside them sits the Eraser lockset algorithm, implemented in C++ from the literature, to catch data races in multithreaded code dynamically instead of by inspection.
Want systems built like this?
I'm open to backend and platform work, contract or permanent — on-site in Belgium and the Netherlands, or fully remote for a team anywhere in the world, US and APAC hours included. EU citizen, so no sponsorship is needed. Tell me what you're building.