Parallel Cache Conscious Hash Trie
-
Updated
May 1, 2018 - Rust
Parallel Cache Conscious Hash Trie
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.
Concurrent HashMap in Rust
A concurrent lock-free hash map for Rust.
A concurrent, lock-free consistent hashing ring implementation in Rust.
WeakSelf is a way to create self-referencing data structures in Rust
A Rust thread-safe, shared (asynchronous) stream buffer designed to lock only on accessing and storing new data.
Lock-free elimination back-off stack
Persistent / Immutable array in Rust.
A simple rust library
Memento: A Framework for Detectable Recoverability in Persistent Memory (PLDI 2023)
Library for modelling Rust applications with actors
AtomicRingBuffer is a constant-size almost lock-free ring buffer with low memory overhead in Rust
Lock-free SPSC FIFO ring buffer with direct access to inner data
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.
Blazing fast concurrent HashMap for Rust.
High performance containers and utilities for concurrent and asynchronous programming
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."