An approach to use atmost only 2 mutex for managing N homogeneous resources.
-
Updated
Jan 16, 2016 - C
An approach to use atmost only 2 mutex for managing N homogeneous resources.
C++ implementation of a non-blocking binary search tree with insert and search
The application implements and compares performance of various concurrent data structures using different algorithms.
hopscotch concurrent hashing
Garbage collected concurrent hash tries.
Single Consumer implementations of a fixed & variable sized FastFlow-Lamport-Thompson ring-buffers
This contains some practice code for a study of shared memory data structures and associated locking mechanisms.
Single Consumer implementations of a fixed & variable sized FastFlow-Lamport-Thompson ring-buffers
Comparing the performance of two different implementations of the concurrent unbounded queue
Comparing the performance of three different implementations of the concurrent linked list
"Concurrent Data Structures - Creation of Inverted Index"
Project to 2013/2014 Operating Systems course of Bachelors Degree in Computer Science and Engineering 2nd Year @ Instituto Superior Técnico WITH @carboned4
hirayaku-threadpool (hthpool), a pure C thread pool implementation
reading list for distributed and conucurrent algorithms (theory and applications)
Custom parallel method and class definitions compatible with Unity 5.5 (.NET 3.5, C# 4.0)
Abstract channel type
Lock-free concurrent work stealing deque in C++
A detailed presentation on the most used concurrent data structures in distributed computing systems.
In-memory immutable wait-free consistent hashing ring data structure, supporting virtual nodes & replication.
Parallel Cache Conscious Hash Trie
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."