Popular repositories Loading
-
sleeping-barber-problem
sleeping-barber-problem PublicThe sleeping barber problem is a classic interprocess communication and synchronization problem between multiple operating system processes.
-
dekker-algorithm
dekker-algorithm PublicDekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming.
-
backoff-lock
backoff-lock PublicBackoff Lock uses an atomic value for critical section execution, and is suitable for memory-limited architectures.
Java 2
-
combining-tree
combining-tree PublicA Combining Tree is an N-ary tree of nodes, that follows software combining to reduce memory contention while updating a shared value.
Repositories
- coarse-set Public
Coarse Set is a collection of unique elements maintained as a linked list. It uses a coarse grained lock, and useful when contention is low.
javaf/coarse-set’s past year of commit activity - optimistic-set Public
Optimistic Set is a linked-list based unique collection. It traverses the list twice per operation, only locking the nodes to be updated.
javaf/optimistic-set’s past year of commit activity - bitonic-network Public
Bitonic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.
javaf/bitonic-network’s past year of commit activity