Concurrent tree structure for in-memory index
-
Updated
Jun 19, 2024 - C++
Concurrent tree structure for in-memory index
A blazingly fast™ single producer multiple consumer broadcast queue
The seq library is a collection of original C++14 STL-like containers and related tools
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 header-only C++ library that allows easily creating thread-safe, concurrency friendly resources.
Small implementation of a classic concurrent programming design pattern: producers/consumers. Coded in C/C++ programming.
In-memory index implementation (btreemap, hashmap, ART-map)
C++17 Library of various queue containers
Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
🐙 An implementation of a concurrent relaxed priority queue
Threads, Semaphore, Mutex, Atomic, Condition Variable -- in Java & C++
C++11 lock-free atomic wrapper
A multithreaded web crawler using two mechanism - single lock and thread safe data structures
concurrent and lockfree data structures 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.
Parallel programming assignment in C++
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."