Really simple C implementation of parallel queue. Three types, lockfree, with locks and monothread queue.
-
Updated
May 29, 2024 - C
Really simple C implementation of parallel queue. Three types, lockfree, with locks and monothread queue.
Software Transactional Memory based on Transaction Locking 2 (TL2) algorithm.
Compare and swap workshops.
Monitor Synchronization in Examples
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.
This project aims at presenting different synchronization techniques
Basic examples of compare and swap.
Implementing concurrent queue using 2 lock approach and non-blocking CAS approach
A sandbox to play with concurrent algorithms and data structures
Atomic Operations API
Performance testing contention queues
Handle duplicate Datomic transactions with ease (on-prem).
Fast and memory-efficient immutable collections and helper data structures
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."