In-memory index implementation (btreemap, hashmap, ART-map)
-
Updated
Jun 5, 2022 - C++
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
C++17 Library of various queue containers
The seq library is a collection of original C++14 STL-like containers and related tools
concurrent and lockfree data structures in C++
Parallel programming assignment in C++
Garbage collected concurrent hash tries.
C++ implementation of a non-blocking binary search tree with insert and search
Comparing the performance of two different implementations of the concurrent unbounded queue
STL-like implementation of a hash map with concurrent robin hood hashing
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
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
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."