Fast and memory-efficient immutable collections and helper data structures
-
Updated
Jun 10, 2025 - C#
Fast and memory-efficient immutable collections and helper data structures
Low(est?)-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allocations, mutexes, CAS-primitives, and false-sharing on the hot path 🍴
Handle duplicate Datomic transactions with ease (on-prem).
Performance testing contention queues
Atomic Operations API
A sandbox to play with concurrent algorithms and data structures
Implementing concurrent queue using 2 lock approach and non-blocking CAS approach
Basic examples of compare and swap.
Software Transactional Memory based on Transaction Locking 2 (TL2) algorithm.
This project aims at presenting different synchronization techniques
A repository for performing deletion of Keyframes and Mappoints that are marked as bad(Logical End of life of the Keyframes and Mappoints) using reference counting and compare and swap.
low latency lock-free zero-copy Inter-Thread Queues
Compare and swap workshops.
Monitor Synchronization in Examples
Really simple C implementation of parallel queue. Three types, lockfree, with locks and monothread queue.
low latency lock-free Inter-Process Queues
Add a description, image, and links to the compare-and-swap topic page so that developers can more easily learn about it.
To associate your repository with the compare-and-swap topic, visit your repo's landing page and select "manage topics."