Skip to content

Popular repositories Loading

  1. sleeping-barber-problem sleeping-barber-problem Public

    The sleeping barber problem is a classic interprocess communication and synchronization problem between multiple operating system processes.

    Java 3 2

  2. dekker-algorithm dekker-algorithm Public

    Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming.

    Java 3 1

  3. mcs-lock 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.

    Java 2 1

  4. clh-lock clh-lock Public

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

    Java 2 1

  5. backoff-lock backoff-lock Public

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

    Java 2

  6. combining-tree 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.

    Java 2 2

Repositories

Showing 10 of 48 repositories
  • javaf.github.io Public

    A summary of programs written in Java.

    HTML 0 MIT 0 0 0 Updated Apr 8, 2025
  • extra-boolean Public

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

    Java 0 MIT 0 0 0 Updated Apr 8, 2025
  • 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.

    Java 0 MIT 1 0 0 Updated Apr 8, 2025
  • 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.

    Java 0 MIT 1 0 0 Updated Apr 8, 2025
  • 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.

    Java 2 MIT 2 0 0 Updated Apr 8, 2025
  • array-queue Public

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

    Java 1 MIT 0 0 0 Updated Apr 8, 2025
  • 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.

    Java 0 MIT 0 0 0 Updated Apr 8, 2025
  • 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.

    Java 1 MIT 0 0 0 Updated Apr 8, 2025
  • backoff-stack Public

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

    Java 0 MIT 0 0 0 Updated Apr 8, 2025
  • hello-world Public

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

    Java 0 MIT 0 0 0 Updated Apr 8, 2025

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…