📶 A lock- and wait-free hashtable (and an array too)
-
Updated
Nov 21, 2024 - C
📶 A lock- and wait-free hashtable (and an array too)
🐛 mulle-multififo multi-producer/multi-consumer FIFO holding `void *`
🔜 fixed sized producer/consumer FIFOs holding void *
Fast, multi-reader, multi-writer, lockless data structures for parallel programming
C Thread Primitives
Repository containing my Assignments and Projects done for course ECEN-5273 Network System at CU Boulder
C Thread Primitives
Multi-producer, multi-consumer, concurrent queue using C11 mutexes.
the fastest in-memory index in the East 东半球最快并发索引
Concurrent Trie Data Structure using Single Locking, Reader Writer's Locking and Hand over Hand Locking.
Concurrent Trie with different locking techniques (HOH, Single lock, Reader-Writer lock)
Policy Against Starvation for Resource Manager
The rep contains object based STM implementation.
the work uses IITH STM lib and imnplements a set application to test the performance of state of art concurrency protocols with the various concurrency mechanism in Synchrobench.
hirayaku-threadpool (hthpool), a pure C thread pool implementation
Project to 2013/2014 Operating Systems course of Bachelors Degree in Computer Science and Engineering 2nd Year @ Instituto Superior Técnico WITH @carboned4
"Concurrent Data Structures - Creation of Inverted Index"
Single Consumer implementations of a fixed & variable sized FastFlow-Lamport-Thompson ring-buffers
An approach to use atmost only 2 mutex for managing N homogeneous resources.
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."