javaf,github

ant-learn

Build test of ant build tool based java project in travis ci

array-lock

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

array-queue

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

array-stack

Array stack is a bounded lock-based stack using an array. It uses a common lock for both push and pop operations.

backoff-lock

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

backoff-stack

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

bakery-algorithm

Bakery algorithm is intended to improve the safety in the usage of shared resources among multiple threads by means of mutual exclusion.

bathroom-lock

A Bathroom Lock allows N genders (thread types) to access a common bathroom (critical section) such that different genders do not clash.

bitonic-network

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

bowling-alley

Bowling Alley Management System assignment in Software Engineering Course.

bowling-alley-original

Bowling Alley Management System assignment in Software Engineering Course (Original Code).

clh-lock

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

coarse-set

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.

combining-tree

A Combining Tree is an N-ary tree of nodes, that follows software combining to reduce memory contention while updating a shared value.

dekker-algorithm

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

dining-philosophers-problem

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

elimination-backoff-stack

Elimination-backoff stack is an unbounded lock-free LIFO linked list, that eliminates concurrent pairs of pushes and pops with exchanges.

extra-bit

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

extra-boolean

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

extra-collection-todo

Basic utility class for handling collections in Java.

extra-db-todo

Skeleton database connection class for java projects

extra-event

Stimulus-reflex (event) library for java

extra-image-todo

Test image compressor in Java.

extra-javascript-todo

This is an open secret.

extra-json-todo

Minimal JSON parser for Java.

extra-sql-todo

SQL command util class that provides named prepared functionality for Java projects.

extra-stream-todo

Minimal brook-canal (byte-char stream) library for Java.

extra-tcp-todo

TCP Server and Client system for Java.

extra-xml

XML support library for Java.

fifo-read-write-lock

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

javaf Goto Github PK

javaf's Projects

Recommend Projects

Recommend Topics

Recommend Org