concurrent-data-structure

Blazing fast concurrent HashMap for Rust.

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

Plsql Database数据库

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

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

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

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

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

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

A ConcurrentHashSet implementation

A ZIO native cache with a simple and compositional interface

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>

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

Lock-free concurrent work stealing deque in C++

A concurrent lock-free hash map for Rust.

🦄 LRU cache for Go @bilibili. (beats 100% submissions @ leetcode)

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

A collection of building blocks for concurrent programming

🔥 类人数据生命的 肽计算, DNA计算思想, 微分催化计算, 肽展定理公式...

Garbage collected concurrent hash tries.

A header-only C++ library that allows easily creating thread-safe, concurrency friendly resources.

A light, high-performance, concurrent, thread-safe skip list implementation written in Golang.

Go Stale While Asynchronously Revalidate Memoization

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.

Ordered-concurrently a library for parallel processing with ordered output in Go. Process work concurrently / in parallel and returns output in a channel in the order of input. It is useful in concurrently / parallelly processing items in a queue, and get output in the order provided by the queue.

🟣 Concurrency Interview Questions Answered to help you get ready for your next Design Patterns & System Architecture interview.

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.

In-memory index implementation (btreemap, hashmap, ART-map)