divide-et-impera

Here is 1 public repository matching this topic...

KevinDepedri / MPI-Parallel-Closest-Pair-of-Points

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

Improve this page

Add a description, image, and links to the divide-et-impera topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the divide-et-impera topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

divide-et-impera

Here is 1 public repository matching this topic...

KevinDepedri / MPI-Parallel-Closest-Pair-of-Points

Improve this page

Add this topic to your repo