COLLECTED BY
Organization:
Internet Archive
Focused crawls are collections of frequently-updated webcrawl data from narrow (as opposed to broad or wide) web crawls, often focused on a single domain or subdomain.
The Wayback Machine - https://web.archive.org/web/20200816042525/https://github.com/topics/concurrent-data-structure
#
concurrent-data-structure
Here are
76 public repositories
matching this topic...
ZIO — A type-safe, composable library for async and concurrent programming in Scala
Updated
Aug 15, 2020
Scala
Blazing fast concurrent HashMap for Rust.
Updated
Aug 13, 2020
Rust
Updated
Nov 27, 2019
Java
A bounded single-producer single-consumer wait-free and lock-free queue written in C++11
the fastest in-memory index in the East 东半球最快并发索引
RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
📶 A lock- and wait-free hashtable (and an array too)
A ConcurrentHashSet implementation
Lock-free SPSC FIFO ring buffer with direct access to inner data
Updated
Jul 16, 2020
Rust
BEAM friendly spinlocks for Elixir/Erlang
Updated
Oct 9, 2019
Erlang
AtomicRingBuffer is a constant-size almost lock-free ring buffer with low memory overhead in Rust
Updated
Apr 23, 2020
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)
Garbage collected concurrent hash tries.
A light, high-performance, concurrent, thread-safe skip list implementation written in Golang.
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.
skipset is a high-performance concurrent sorted set based on skip list. Up to 3x ~ 6x faster than sync.Map in the typical pattern.
Parallel Cache Conscious Hash Trie
Go Stale While Asynchronously Revalidate Memoization
hopscotch concurrent hashing
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)
Single Consumer implementations of a fixed & variable sized FastFlow-Lamport-Thompson ring-buffers
A header-only C++ library that allows easily creating thread-safe, concurrency friendly resources.
Updated
Jun 3, 2019
Python
Concurrent HashMap in Rust
In-memory immutable wait-free consistent hashing ring data structure, supporting virtual nodes & replication.
Improve this page
Add a description, image, and links to the
concurrent-data-structure
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
concurrent-data-structure
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.
