Pinned Repositories
BERT_yelp_review_classifier
Yelp review classifier using BERT
Code-Merge-History
This script fetches the commit history for given repo from GIT and Perforce with Jenkins as CI system. This script can be called from Jenkins with passing simple parameters such as Repo name and the time since when you wnat to pull in history and generates HTML file.
docker-stacks
Ready-to-run Docker images containing Jupyter applications
Fidge-Mattern-Vector-Clock-Time-stamp-implementation
Tags : Fidge Mattern Vector Clock , timestamps , Vector clock ,Distributed network
KafkaAWS
Kafka instance on AWS
kmeans
Sklern Kmeans implementation for finding elbow and centroids based on optimum number of clusters
NLP
Natural Language Processing basic building blocks
Preventing-Useless-Checkpoints
In this project, you have to implement a communication-based distributed algorithm for avoiding useless checkpoints. To that end, first implement a distributed application that takes two parameters: mean inter message transmission time (MTT) and mean inter independent checkpointing time (ICT). The first parameter denotes the mean time between two successive message transmissions by a node. The second parameter denotes the mean time between two successive independent checkpoints by a node. Assume that inter message transmission time at a node is exponentially distributed with mean MTT, and inter independent checkpointing time is uniformly distributed in the range [0.5 · ICT, 1.5 · ICT]. You can assume that the communication topology is a complete graph. Next, implement Helary et al.’s algorithm for preventing a checkpoint from becoming useless, and evaluate its performance (in terms of number of forced checkpoints) experimentally. This algorithm is based on logical clock and was discussed in the class. Measure the variation in the number of forced checkpoints taken by nodes with the increase in: (i) the mean inter message transmission time, and (ii) the mean inter independent checkpointing time. Show the results using a graph. Note that you should only vary one parameter at a time. Also, each data point in a graph should be obtained by averaging over several runs.
Suzuki-Kasami-Mutual-Exclusion-Algorithm
Implementation of Suzuki Kasami Token based Mutual Exclusion Algorithm
neileshc's Repositories
neileshc/BERT_yelp_review_classifier
Yelp review classifier using BERT
neileshc/Preventing-Useless-Checkpoints
In this project, you have to implement a communication-based distributed algorithm for avoiding useless checkpoints. To that end, first implement a distributed application that takes two parameters: mean inter message transmission time (MTT) and mean inter independent checkpointing time (ICT). The first parameter denotes the mean time between two successive message transmissions by a node. The second parameter denotes the mean time between two successive independent checkpoints by a node. Assume that inter message transmission time at a node is exponentially distributed with mean MTT, and inter independent checkpointing time is uniformly distributed in the range [0.5 · ICT, 1.5 · ICT]. You can assume that the communication topology is a complete graph. Next, implement Helary et al.’s algorithm for preventing a checkpoint from becoming useless, and evaluate its performance (in terms of number of forced checkpoints) experimentally. This algorithm is based on logical clock and was discussed in the class. Measure the variation in the number of forced checkpoints taken by nodes with the increase in: (i) the mean inter message transmission time, and (ii) the mean inter independent checkpointing time. Show the results using a graph. Note that you should only vary one parameter at a time. Also, each data point in a graph should be obtained by averaging over several runs.
neileshc/Suzuki-Kasami-Mutual-Exclusion-Algorithm
Implementation of Suzuki Kasami Token based Mutual Exclusion Algorithm
neileshc/Code-Merge-History
This script fetches the commit history for given repo from GIT and Perforce with Jenkins as CI system. This script can be called from Jenkins with passing simple parameters such as Repo name and the time since when you wnat to pull in history and generates HTML file.
neileshc/docker-stacks
Ready-to-run Docker images containing Jupyter applications
neileshc/Fidge-Mattern-Vector-Clock-Time-stamp-implementation
Tags : Fidge Mattern Vector Clock , timestamps , Vector clock ,Distributed network
neileshc/KafkaAWS
Kafka instance on AWS
neileshc/kmeans
Sklern Kmeans implementation for finding elbow and centroids based on optimum number of clusters
neileshc/NLP
Natural Language Processing basic building blocks