You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This repository stores a project whose aim is to parallelize some algorithms for the search of the strongly connected components of a graph. The parallelization method has been applied both on the Tarjan and Kosaraju algorithms.
Program to estimate speedup and efficiency on different numbers of pthreads, using OpenMP. Programa para estimar o speedup e a eficiência sobre um número diferente de pthread, usando OpenMP.
Program to estimate speedup and efficiency on different numbers of pthreads by measuring the execution time. Programa para estimar o speedup e a eficiência sobre um número diferente de pthreads ao mensurar o tempo de execução.
In this task, we were given some code snippets and we had to calculate the Dependencies in the code and if resolveable, we needed to re-write the code to remove any sort of dependencies. Furthermore, we had to calculate the speedup graphs too.
This repository contains lab work of High Performance Computing. This course is offered at DA-IICT in 6th semester (3rd Year). The main purpose of this course is to get maximum throughput from any system. Depending upon the cache size, processor and using multi threading via open-mp, we are analyzing the performance, its efficiency, speedup, thr…
Below is the code of our thesis: A Three-Level Parallel Algorithm Using AVX For MrBayes 3.2. Mingjie Zhao did most of the work, and I am glad that I did make some contributions to performance optimization.