Lower-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 🍴

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

Software Transactional Memory based on Transaction Locking 2 (TL2) algorithm.

Basic examples of compare and swap.

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.

Monitor Synchronization in Examples

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

Compare and swap workshops.

A real-time stock trading engine built in Java that reliably matches Buy and Sell orders under concurrent load. By using lock-free data structures, the system avoids traditional synchronization bottlenecks, enabling higher throughput and predictable performance in multi-threaded environments. Orders are matched using price-priority logic with O(n)

low latency lock-free zero-copy Inter-Thread Queues

Stock reservation with layered architecture, CQRS, ADRs, and event sourcing using an outbox pattern with custom Compare-And-Swap & locking mechanisms.

low latency lock-free Inter-Process Queues

🖼️ Streamline your image management with imtools, a fast CLI for sorting, flattening, and finding duplicates, all with zero runtime dependencies.