There are 12 repositories under concurrent-data-structure topic.
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.
High performance containers and utilities for concurrent and asynchronous programming
Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
A ConcurrentHashSet implementation
📶 A lock- and wait-free hashtable (and an array too)
The seq library is a collection of original C++14 STL-like containers and related tools
A SIMD-accelerated concurrent hash table.
BEAM friendly spinlocks for Elixir/Erlang
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>
Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.
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 multithreaded web crawler using two mechanism - single lock and thread safe data structures
A concurrent lock-free hash map for Rust.
🦄 LRU cache for Go @bilibili. (beats 100% submissions @ leetcode)
A light, high-performance, concurrent, thread-safe skip list implementation written in Golang.
A header-only C++ library that allows easily creating thread-safe, concurrency friendly resources.
Garbage collected concurrent hash tries.
🔥 DNA微分催化与肽计算, 元基花计算,进化计算,遗传计算,智慧计算,索引计算,元基编码,肽展公式,大数据计算分析
ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
Lock-free elimination back-off stack
The rep contains my experiments with state of the art NVM programming abstractions during my internship at Regal Lab of Inria Paris under the supervision of Dr Marc Shapiro and Dr Gael Thomas.
A concurrent, lock-free consistent hashing ring implementation in Rust.