Displaying 1 to 7 from 7 results

JCTools - Java Concurrency Tools for the JVM


Java Concurrency Tools for the JVM. This project aims to offer some concurrent data structures currently missing from the JDK.

capture-thread - Framework for loggers, tracers, and mockers in multithreaded C++ programs.


Framework for loggers, tracers, and mockers in multithreaded C++ programs.When developing C++ projects, instrumentation is frequently used to collect information from the system, inject information into the system, or both. The role of this information within the system rarely lines up with the actual structure of the project.

L4 - L4 (Lock-Free on Read) Hashtable is a C++ library that implements hash table with arbitray byte stream keys/values


L4 (Lock-Free on Read) Hashtable is a C++ library that provides a fixed-size hashtable, where keys and values are arbitrary bytes.L4 HashTable is optimized for lookup operations. It uses Epoch Queue (deterministic garbage collector) to achieve lock-free lookup operations.

bus - Efficient, lock-free, bounded Rust broadcast channel


Bus provides a lock-free, bounded, single-producer, multi-consumer, broadcast channel. It uses a circular buffer and atomic instructions to implement a lock-free single-producer, multi-consumer channel. The interface is similar to that of the std::sync::mpsc channels, except that multiple consumers (readers of the channel) can be produced, whereas only a single sender can exist. Furthermore, in contrast to most multi-consumer FIFO queues, bus is broadcast; every send goes to every consumer.




rust-evmap - A lock-free, eventually consistent, concurrent multi-value map.


A lock-free, eventually consistent, concurrent multi-value map. This map implementation allows reads and writes to execute entirely in parallel, with no implicit synchronization overhead. Reads never take locks on their critical path, and neither do writes assuming there is a single writer (multi-writer is possible using a Mutex), which significantly improves performance under contention.

SPSCQueue - A bounded single-producer single-consumer wait-free and lock-free queue written in C++11


A single producer single consumer wait-free and lock-free fixed size queue written in C++11. Create a SPSCqueue holding items of type T with capacity capacity. Capacity need to be greater than 2.

TokenBucket - Lock-free implementation of the token bucket algorithm in C++


Lock-free implementation of the token bucket algorithm in C++11. This project was created by Erik Rigtorp <erik@rigtorp.se>.