A bounded single-producer single-consumer wait-free and lock-free queue written in C++11
-
Updated
Jan 4, 2024 - C++
A bounded single-producer single-consumer wait-free and lock-free queue written in C++11
RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
The seq library is a collection of original C++14 STL-like containers and related tools
Lock-free concurrent work stealing deque in C++
A multithreaded web crawler using two mechanism - single lock and thread safe data structures
A header-only C++ library that allows easily creating thread-safe, concurrency friendly resources.
Garbage collected concurrent hash tries.
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 blazingly fast™ single producer multiple consumer broadcast queue
Concurrent tree structure for in-memory index
hopscotch concurrent hashing
In-memory index implementation (btreemap, hashmap, ART-map)
concurrent and lockfree data structures in C++
The multi threaded queue service is a class that operates as a message processing service
This repository contains the source code of the Concurrent Graph Data Structure
C++17 Library of various queue containers
Add a description, image, and links to the concurrent-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the concurrent-data-structure topic, visit your repo's landing page and select "manage topics."