C++ implementation of a non-blocking binary search tree with insert and search
-
Updated
Aug 30, 2016 - C++
C++ implementation of a non-blocking binary search tree with insert and search
hopscotch concurrent hashing
Garbage collected concurrent hash tries.
Comparing the performance of two different implementations of the concurrent unbounded queue
Comparing the performance of three different implementations of the concurrent linked list
Lock-free concurrent work stealing deque 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
STL-like implementation of a hash map with concurrent robin hood hashing
Parallel programming assignment 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.
concurrent and lockfree data structures in C++
A multithreaded web crawler using two mechanism - single lock and thread safe data structures
C++11 lock-free atomic wrapper
Threads, Semaphore, Mutex, Atomic, Condition Variable -- in Java & C++
🐙 An implementation of a concurrent relaxed priority queue
Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
C++17 Library of various queue containers
In-memory index implementation (btreemap, hashmap, ART-map)
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."