Parallel MPI implementation of Bruteforce and Divide et Impera approaches to solve the Closest Pair of Points problem leveraging the HPC infrastructure provided by the University of Trento
hpc
cluster
mpi
parallel-computing
bruteforce
hpc-clusters
mpich
divide-and-conquer
parallel-programming
parallel-implementations
closest-pair-of-points
divide-et-impera
-
Updated
Jul 6, 2023 - Shell