Fast and memory-efficient immutable collections and helper data structures

Handle duplicate Datomic transactions with ease (on-prem).

Performance testing contention queues

A sandbox to play with concurrent algorithms and data structures

Atomic Operations API

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

Package atomic provides low-level atomic memory primitives useful for implementing synchronization algorithms.

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.

Really simple C implementation of parallel queue. Three types, lockfree, with locks and monothread queue.

Compare and swap workshops.

Monitor Synchronization in Examples