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)
A multithreaded web crawler using two mechanism - single lock and thread safe data structures
Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
This repository contains the source code of the Concurrent Graph Data Structure
A header-only C++ library that allows easily creating thread-safe, concurrency friendly resources.
Lock-free concurrent work stealing deque in C++
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.
hopscotch concurrent hashing
🐙 An implementation of a concurrent relaxed priority queue
Comparing the performance of three different implementations of the concurrent linked list
C++11 lock-free atomic wrapper
Concurrent tree structure for in-memory index
A blazingly fast™ single producer multiple consumer broadcast queue
In-memory index implementation (btreemap, hashmap, ART-map)
Small implementation of a classic concurrent programming design pattern: producers/consumers. Coded in C/C++ programming.
Threads, Semaphore, Mutex, Atomic, Condition Variable -- in Java & C++
The multi threaded queue service is a class that operates as a message processing service
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."