Skip to content

EdmondDantes21/parallel_closest_pair_of_points

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 

Repository files navigation

Parallel Closest pair of points

This repository contains all the material used for carrying out the high performance computing for data science project. The course is given by professor Francesco Fiore during the second semester of 2023 at the university of Trento.

The closest pair problem is a fundamental problem in computational geometry that consists in identifying the closest pair of points among a very large dataset of 𝑁 points. This project focuses on the parallelization of the most common techniques through OpenMP and MPI. The methodologies under consideration include the naive solution and the divide-et-impera approach.

About

This repository contains all the material used for carrying out the high performance computing for data science project. The goal is to parallelize the closest pair problem through MPI and OpenMP.

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors