Bitonic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.
-
Updated
Dec 19, 2020 - Java
Bitonic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.
Data Structures Implementations in Java
Some java structures classes that can help you with some problems
Elimination-backoff stack is an unbounded lock-free LIFO linked list, that eliminates concurrent pairs of pushes and pops with exchanges.
CS146: Data Structures at SJSU (Algorithms By Robert Sedgewick et al)
Backoff stack is an unbounded lock-free LIFO linked list, where pushes and pops synchronize at a single location.
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.
Semaphore is a generalization of mutual exclusion locks. It allows at most N threads into critical section. Java has a built-in Semaphore.
Algorithms and Data Structures implementations
Aprendiendo a construir estructuras básicas de datos para ramo 'Desarrollo en Java'
This is a program to practice OOP, data structures ad recursion
Data Structures using Java
willyOS for java developers
k-compare single-swap (KCSS) is an extension of CAS that enables atomically checking multiple addresses before making an update.
A savings account is used to store salary/savings in a bank. This is a concurrent object (RAM) based account. For educational purposes only.
Lab practical exercises for Data Structures and Algorithms
Add a description, image, and links to the structures topic page so that developers can more easily learn about it.
To associate your repository with the structures topic, visit your repo's landing page and select "manage topics."