OptimLib: a lightweight C++ library of numerical optimization methods for nonlinear functions

Implementation of AMD HIP for CPUs

Sequential and Parallel(using Open MP and Pthreads) Implementations(c++) of the K Means Clustering Algorithm and visualizing the results for a comparative study of the Speedup and Efficiency achieved in 3 different implementations

An implementation of parallel Boruvka's algorithm written in C++ using OpenMP.

C++, OpenMP and CUDA implementation of Mean Shift clustering algorithm

Framework for building parallel cellular automata in C++. In it you can also find a work-stealing threadpool and a reusable barrier that you can use in other projects.

This was our Final Project for Distributed Computing. In this we had to create a distributed system that will use the Brute Force Algorithm to crack a password from the etc/shadows file of Ubuntu as all the passwords are stored there. We used OpenMP and MPICH for this implementation.

In this task, we had to write a multi-threaded OpenMP program, that will solve the consensus problem. If all the slave (child) processes agree on a single decision, then the processes will terminate displaying consensus reached.

Parallel computing: Infectious Disease Modeling with OpenMP. Agent based modelling on Undirected Acyclic graphs.

A Visualisation of N-body Gravitational body system in OpenCV using C++ and OpenMP parallelization

In this task, we had to write a multi-threaded OpenMP program, that will print the number of threads being used.

This project implements a N-Body Simulation using OpenCL and OpenGL. It can be used to benchmark both GPU and CPU.

A repository for the codes used in my MSc thesis

This repository has MVM assignment in the course COL730 Parallel Programming taught by Prof. Kolin Paul at IIT, Delhi in Fall 2019

Password Cracker program coded in C++ language by applying brute force algorithm and parallelizing it using MPI and OpenMP

Parallelised Data Backup Using Hash (Merkle) Trees

In this task, I wrote the code using both OpenMP and MPI inorder to parallelize it. What it does is that the master process distributes a chunk of number equally among the slave processes. Each slave process then searches for the number to find. When one slave process finds the number, it sends a message to the master process who then sends a "t…

sudoku solver which takes an image as input and displays the solved output in the terminal. A neural network trained in Pytorch is used to identify the numbers present in the sudoku puzzle

An OpenMP based solution for computing K-most frequent words in a corpus (see README for more). Also, my submission for Assignment 2 of Parallel Computing Course, BITS Pilani (2nd Sem 2017/18)

In this project, the Traveling Salesman Problem is addressed. There are several approaches implemented. The project was done in C++ 17 and OpenMP 5.1.