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

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

Plsql Database数据库

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.

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++

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.

Garbage collected concurrent hash tries.

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

🔥 DNA微分催化与肽计算， 元基花计算，进化计算，遗传计算，智慧计算，索引计算，元基编码，肽展公式，大数据计算分析

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

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.

Go Stale While Asynchronously Revalidate Memoization

A multithreaded web crawler using two mechanism - single lock and thread safe data structures

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.

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