Skip to content
@javaf

javaf

Popular repositories

  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 1

  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 1 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 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 1

  6. locked-queue 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.

    Java 1

Repositories

Showing 10 of 48 repositories
  • bowling-alley Public

    Bowling Alley Management System assignment in Software Engineering Course.

    Java 0 MIT 0 0 0 Updated May 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.

    Java 1 MIT 0 0 0 Updated Apr 8, 2022
  • javaf.github.io Public

    A summary of programs written in Java.

    0 MIT 0 0 0 Updated Mar 31, 2022
  • extra-boolean Public template

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

    Java 0 MIT 0 0 0 Updated Mar 24, 2021
  • hello-world Public template

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

    Java 0 MIT 0 0 0 Updated Jan 25, 2021
  • extra-bit Public

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

    Java 0 MIT 0 0 0 Updated Jan 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.

    Java 0 MIT 0 0 0 Updated Dec 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.

    Java 0 MIT 0 0 0 Updated Dec 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 0 MIT 0 0 0 Updated Dec 19, 2020
  • bitonic-network Public

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

    Java 0 MIT 0 0 0 Updated Dec 19, 2020
View all repositories

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…