javaf Goto Github PK
Type: Organization
Blog: https://javaf.github.io/
Type: Organization
Blog: https://javaf.github.io/
Build test of ant build tool based java project in travis ci
Array Queue Lock maintains a fixed array for critical section execution, and is suitable for cache-less static memory architectures.
Array queue is a bounded lock-based FIFO queue using an array. It uses 2 separate locks for head and tail.
Array stack is a bounded lock-based stack using an array. It uses a common lock for both push and pop operations.
Backoff Lock uses an atomic value for critical section execution, and is suitable for memory-limited architectures.
Backoff stack is an unbounded lock-free LIFO linked list, where pushes and pops synchronize at a single location.
Bakery algorithm is intended to improve the safety in the usage of shared resources among multiple threads by means of mutual exclusion.
A Bathroom Lock allows N genders (thread types) to access a common bathroom (critical section) such that different genders do not clash.
Bitonic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.
Bowling Alley Management System assignment in Software Engineering Course.
Bowling Alley Management System assignment in Software Engineering Course (Original Code).
CLH Queue Lock maintains a linked-list for threads waiting to enter critical section, and is suitable for cache-coherent architectures.
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.
A Combining Tree is an N-ary tree of nodes, that follows software combining to reduce memory contention while updating a shared value.
Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming.
The dining philosophers problem is an example problem often used in concurrent algorithm design.
Elimination-backoff stack is an unbounded lock-free LIFO linked list, that eliminates concurrent pairs of pushes and pops with exchanges.
The bit is a basic unit of information in information theory, computing.
Boolean data type has two possible truth values to represent logic.
Basic utility class for handling collections in Java.
Skeleton database connection class for java projects
Stimulus-reflex (event) library for java
Test image compressor in Java.
This is an open secret.
Minimal JSON parser for Java.
SQL command util class that provides named prepared functionality for Java projects.
Minimal brook-canal (byte-char stream) library for Java.
TCP Server and Client system for Java.
XML support library for Java.
FIFO Read-write Lock blocks any new readers once a writer requests, thus preventing writer lock-out due to continual stream of readers.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.