concurrent-data-structure

ZIO — A type-safe, composable library for async and concurrent programming in Scala

Blazing fast concurrent HashMap for Rust.

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

the fastest in-memory index in the East 东半球最快并发索引

Plsql Database数据库

skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.

RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)

Lock-free SPSC FIFO ring buffer with direct access to inner data

Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17

📶 A lock- and wait-free hashtable (and an array too)

A ConcurrentHashSet implementation

A ZIO native cache with a simple and compositional interface

Fast, multi-reader, multi-writer, lockless data structures for parallel programming

BEAM friendly spinlocks for Elixir/Erlang

A SIMD-accelerated concurrent hash table.

A faster RWLock primitive in Go, 2-3 times faster than RWMutex. A Go implementation of concurrency control algorithm in paper <Left-Right - A Concurrency Control Technique with Wait-Free Population Oblivious Reads>

AtomicRingBuffer is a constant-size almost lock-free ring buffer with low memory overhead in Rust

Lock-free concurrent work stealing deque in C++

Códigos feitos para o curso de Multithreading com Java, no canal RinaldoDev do YouTube.

A concurrent lock-free hash map for Rust.