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.
Multi thread-safe Micro-service framework based on a Message Bus design pattern and a virtual bookstore implmented on top of that.
C++11 lock-free atomic wrapper
Comparing the performance of three different implementations of the concurrent linked list
Policy Against Starvation for Resource Manager
Threads, Semaphore, Mutex, Atomic, Condition Variable -- in Java & C++
Concurrent Trie Data Structure using Single Locking, Reader Writer's Locking and Hand over Hand Locking.
Scala learning exercises from zero to hero
Parallel programming assignment in C++
Yet another Java 8 web crawler (ForkJoinPool, RecursiveAction, ConcurrentHashMap, jsoup)
Cybersecurity Toolkit
java-practice
🔜 fixed sized producer/consumer FIFOs holding void *
Comparing the performance of two different implementations of the concurrent unbounded queue
Various implementations of linked list based set
C++ implementation of a non-blocking binary search tree with insert and search
COP 4520 - Lock-free k-FIFO Queues + Transactional FIFO Queues
🐙 An implementation of a concurrent relaxed priority queue
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."