Implements a lock-free multi-producer/multi-consumer queue (NEMESIS) used for work-stealing between workers. This is a self-contained, high-performance concurrent queue that could be extracted and reused in other parallel runtimes or libraries. It uses CAS operations and hazard pointers for safe memory reclamation.

A thread-caching memory pool allocator that provides fast allocation and deallocation of fixed-size blocks. Each thread has a local cache to reduce contention, with periodic returns to a global pool. This pattern is ideal for any concurrent application needing low-overhead memory management and is reusable with minimal adaptation.

A portable abstraction over Linux futex and other platform-specific waiting mechanisms. It provides 'wait' and 'wake' operations on atomic memory locations, enabling efficient blocking synchronization without spinloops. This header is small, self-contained, and demonstrates how to build cross-platform atomic waiting primitives.

A lock-free hash map implementation using split-ordered lists (Shavit). It supports insertion, deletion, and lookup using only CAS operations, and dynamically resizes without locks. This is a non-trivial, reusable concurrent hash map that can be extracted for use in other systems requiring lock-free associative storage.

A logarithmic barrier implementation using syncvar trees. It creates a tree of syncvar-based barriers where each node synchronizes two subtrees, achieving O(log N) time. This pattern is reusable as a building block for hierarchical synchronization in parallel applications.