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
- savings-account Public
A savings account is used to store salary/savings in a bank. This is a concurrent object (RAM) based account. For educational purposes only.
- bathroom-lock Public
A Bathroom Lock allows N genders (thread types) to access a common bathroom (critical section) such that different genders do not clash.
- combining-tree Public
A Combining Tree is an N-ary tree of nodes, that follows software combining to reduce memory contention while updating a shared value.
- array-queue Public
Array queue is a bounded lock-based FIFO queue using an array. It uses 2 separate locks for head and tail.
- array-stack Public
Array stack is a bounded lock-based stack using an array. It uses a common lock for both push and pop operations.
- elimination-backoff-stack Public
Elimination-backoff stack is an unbounded lock-free LIFO linked list, that eliminates concurrent pairs of pushes and pops with exchanges.
- backoff-stack Public
Backoff stack is an unbounded lock-free LIFO linked list, where pushes and pops synchronize at a single location.
People
This organization has no public members. You must be a member to see who’s a part of this organization.
Top languages
Loading…
Most used topics
Loading…