anandjbangad Goto Github PK

attempt1

braintree_java

Braintree Java library

chronos

cloud-node-spring-kafka-json

cluster-cloud-node

cluster-common

cluster-device-node

cluster-edge-node

datastructurepractise

device-node-spring-kafka-json

elements-of-interview-programming-in-java

energy-meter

hetrogeneousmultirobotcommunication

http-client-server

A Client-Server Application is created in JAVA using Eclipse IDE on Windows 10 OS. Simplified versions of HTTP client program is designed, implemented and tested for various conditions in this project. The client program queries the user for an HTML file name and returns the length and contents of the file if the file is available on the server. Various errors have been tested on this application.

kafka_kerberose

learnyounode

linux-kernel

linux-kernel-data-structures

Implementation of Linux Kernel Data Structures - Linked List, Queues, Red Black Tree, HashMaps

non-blocking-k--ary-search-tree-manual-memory-managgement

This work presents the generalization of a Concurrent Binary Search Tree to a Non-Blocking leaf oriented Concurrent K-Ary Search Tree in Java. We used single-word compare-and-set operations to coordinate updates to the tree. Further we extend the implementation to work without Java’s garbage collector for manual memory management. We use the concept of thread local pool of pre-allocated nodes for the memory management. The potential ABA problem that arises is taken care by using AtomicStampedRefference

non-blocking-k-ary-n-ary-search-tree

This is an implementation of a Concurrent K-Ary leaf oriented Search Tree. In this implementation, rely on Java's Garbage Collector to recycle the nodes that are removed from the tree as part of Insertion/Deletion process.

peterson-lock-in-a-binary-tree

Consider a generalization of the twothread Peterson lock by arranging a number of 2-thread Peterson locks in a binary tree, as follows. Each thread is assigned a leaf lock, which it shares with one other thread. Each lock treats one thread as thread 0 and the other as thread 1. In the tree-lock's acquire method, the thread acquires every two-thread Peterson lock from that thread's leaf to the root. The treelock's release method for the tree-lock unlocks each of the 2-thread Peterson locks that thread has acquired, from the root back to its leaf. At any time, a thread can be delayed for a finite duration.

priority-based-clh-lock

The CLH lock provides FCFS fairness, which is a useful property for many applications. But some applications may attach priorities to

recommendationsystem

semi-linearizable-queue

spring-kafka-cloud-node-string

spring-kafka-device-node-string

spring-kafka-edge-node-string

test

tutorials

Just Announced - "Learn Spring Security OAuth":

twitter-vending-machine

This was built for the publicity of a hackathon. Whenever the participants tweet on the hackathon page they get a code in their inbox. W