Blazing fast concurrent HashMap for Rust.
-
Updated
Jun 24, 2024 - Rust
Blazing fast concurrent HashMap for Rust.
Lock-free SPSC FIFO ring buffer with direct access to inner data
High performance containers and utilities for concurrent and asynchronous programming
AtomicRingBuffer is a constant-size almost lock-free ring buffer with low memory overhead in Rust
A concurrent lock-free hash map for Rust.
Memento: A Framework for Detectable Recoverability in Persistent Memory (PLDI 2023)
Lock-free elimination back-off stack
Library for modelling Rust applications with actors
Defines several array types in which elements may be updated atomically. Intended to provide atomic array types similar to those found in java.util.concurrent.atomic in Java.
A concurrent, lock-free consistent hashing ring implementation in Rust.
A Rust thread-safe, shared (asynchronous) stream buffer designed to lock only on accessing and storing new data.
Parallel Cache Conscious Hash Trie
Persistent / Immutable array in Rust.
A simple rust library
Concurrent HashMap in Rust
WeakSelf is a way to create self-referencing data structures in Rust
Implements a vector-based slab-like map with an interface similar to that of HashMap, and also provides tools for generating lightweight identifiers that can be type-safely used as keys for this map.
A high-performance, lock-free ring buffer for single-producer, single-consumer scenarios.
Add a description, image, and links to the concurrent-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the concurrent-data-structure topic, visit your repo's landing page and select "manage topics."