Repositories list

• bowling-alley

  Public
  Bowling Alley Management System assignment in Software Engineering Course.

  Java

  •

  MIT License

  •0•0•0•0•Updated May 24, 2023May 24, 2023

• clh-lock

  Public
  CLH Queue Lock maintains a linked-list for threads waiting to enter critical section, and is suitable for cache-coherent architectures.

  javaqueuelock+ 1clh

  Java

  •

  MIT License

  •1•1•0•0•Updated Apr 8, 2022Apr 8, 2022

• javaf.github.io

  Public
  A summary of programs written in Java.

  MIT License

  •0•0•0•0•Updated Mar 31, 2022Mar 31, 2022

• extra-boolean

  Public template
  Boolean data type has two possible truth values to represent logic.

  parsealgebralogic+ 5booleanextraxorimpeqv

  Java

  •

  MIT License

  •0•0•0•0•Updated Mar 24, 2021Mar 24, 2021

• hello-world

  Public template
  A "Hello, World!" is an introductory computer program.

  githubjavatemplate+ 6hellopackageworldpuzzlemavencentral

  Java

  •

  MIT License

  •0•0•0•0•Updated Jan 25, 2021Jan 25, 2021

• extra-bit

  Public
  The bit is a basic unit of information in information theory, computing.

  javacountmaven+ 16bitmergescantoggleparitybitwiseoperations+ 9

  Java

  •

  MIT License

  •0•0•0•0•Updated Jan 24, 2021Jan 24, 2021

• 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.

  javasetdata+ 3structuresconcurrentcoarse

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• fine-set

  Public
  Fine Set is a collection of unique elements maintained as linked list. It uses fine grained locks, allowing pipelined traversal by threads.

  javasetdata+ 5structureslockconcurrentfinegrained

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• 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.

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• bitonic-network

  Public
  Bitonic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.

  javadatanetwork+ 6structurescoordinationdistributedconcurrentcountingbitonic

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• periodic-network

  Public
  Periodic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.

  javadatanetwork+ 6structurescoordinationdistributedconcurrentcountingperiodic

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• k-compare-single-swap

  Public
  k-compare single-swap (KCSS) is an extension of CAS that enables atomically checking multiple addresses before making an update.

  javasetdata+ 7structureskcasswapcompareconcurrentsingle

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• backoff-stack

  Public
  Backoff stack is an unbounded lock-free LIFO linked list, where pushes and pops synchronize at a single location.

  javadatastack+ 7structureslockfreebackoffconcurrentlifounbounded

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• 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.

  javadatastack+ 7structureslockfreebackoffconcurrentlifoelimination

  Java

  •

  MIT License

  •0•1•0•0•Updated Dec 19, 2020Dec 19, 2020

• 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.

  javadatastack+ 6arraystructureslockconcurrentcommonbounded

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• array-queue

  Public
  Array queue is a bounded lock-based FIFO queue using an array. It uses 2 separate locks for head and tail.

  javadataqueue+ 8arraystructureslockstailconcurrentheadfifo+ 1

  Java

  •

  MIT License

  •0•1•0•0•Updated Dec 19, 2020Dec 19, 2020

• 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.

  datatreebinary+ 10structuresyaysoftwareconcurrenttrinaryhardnary+ 3

  Java

  •

  MIT License

  •2•1•0•0•Updated Dec 19, 2020Dec 19, 2020

• 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.

  javadatastructures+ 10lockproblemconcurrentsharedthreadschapter8+ 3

  Java

  •

  MIT License

  •1•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• 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.

  javadataram+ 6objectbankstructuresconcurrentsavingsaccount

  Java

  •

  MIT License

  •1•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• mcs-lock

  Public
  MCS Queue Lock maintains a linked-list for threads waiting to enter critical section, and is suitable for cache-less NUMA architectures.

  javaqueuelock+ 1mcs

  Java

  •

  MIT License

  •1•1•0•0•Updated Dec 19, 2020Dec 19, 2020

• array-lock

  Public
  Array Queue Lock maintains a fixed array for critical section execution, and is suitable for cache-less static memory architectures.

  javaqueuearray+ 1lock

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• backoff-lock

  Public
  Backoff Lock uses an atomic value for critical section execution, and is suitable for memory-limited architectures.

  javalockbackoff+ 1exponential

  Java

  •

  MIT License

  •0•2•0•0•Updated Dec 19, 2020Dec 19, 2020

• ttas-lock

  Public
  Test-test-and-set Lock uses an atomic value for critical section execution, and is suitable for low contention memory-limited architectures.

  javasettest+ 2lockttas

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• tas-lock

  Public
  Test-and-set Lock uses an atomic value for critical section execution, and is suitable for educational purposes only.

  javasettest+ 2locktest-and-set

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• locked-queue

  Public
  A Locked Queue in a concurrent FIFO queue that uses locks and conditions to block enqueue when queue is full, and dequeue when it is empty.

  javadataqueue+ 9structuresblockingobjectssignalawaitconcurrentmonitors+ 2

  Java

  •

  MIT License

  •0•1•0•0•Updated Dec 19, 2020Dec 19, 2020

• simple-read-write-lock

  Public
  Simple Read-write Lock uses a counter and a boolean flag to keep track of multiple readers and a writer, but does not prioritize writers.

  javadatasimple+ 5readstructureslockconcurrentwrite

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• fifo-read-write-lock

  Public
  FIFO Read-write Lock blocks any new readers once a writer requests, thus preventing writer lock-out due to continual stream of readers.

  javadataread+ 5structureslockconcurrentwritefifo

  Java

  •

  MIT License

  •0•1•0•0•Updated Dec 19, 2020Dec 19, 2020

• simple-reentrant-lock

  Public
  A lock is re-entrant if it can be acquired multiple times by the same thread. Java already provides one. This for educational purposes only.

  javadatasimple+ 4structureslockconcurrentreentrant

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• simple-semaphore

  Public
  Semaphore is a generalization of mutual exclusion locks. It allows at most N threads into critical section. Java has a built-in Semaphore.

  javadatasimple+ 3structuressemaphoreconcurrent

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020

• dining-philosophers-problem

  Public
  The dining philosophers problem is an example problem often used in concurrent algorithm design.

  datapatternstructure+ 6concurrencyproblemconcurrentdiningjavaphilosopher

  Java

  •

  MIT License

  •0•0•0•0•Updated Dec 19, 2020Dec 19, 2020