Author Topic: Searching for nearby nodes in MPI  (Read 407 times)

MikeA

  • Newbie
  • *
  • Posts: 21
Searching for nearby nodes in MPI
« on: March 14, 2016, 06:12:22 PM »
Does anyone know if it is possible to search for nearby nodes (using a position/node and a search radius) in MPI? What I am looking for is something like the kdtree that also finds nodes on neighbour processes.

Thanks

Carlos Roig

  • Newbie
  • *
  • Posts: 16
Re: Searching for nearby nodes in MPI
« Reply #1 on: March 14, 2016, 09:12:45 PM »
It can be done, there are mpi versions of several search structures. You can find them in the "mpi_search_application" (you will have to compile it as well). If you are familiar with the regular search structures of kratos this should work in the same way.

According to your necessities the file to use should be one of these:

"mpi_search_application/custom_utilities/bins_dynamic_mpi.h"
"mpi_search_application/custom_utilities/bins_dynamic_objects_mpi.h"


Let me know if you have any problems using this so I can help you with the details.

Br!

MikeA

  • Newbie
  • *
  • Posts: 21
Re: Searching for nearby nodes in MPI
« Reply #2 on: March 16, 2016, 02:53:22 PM »
Thanks for the hint! This will be very useful for the future parallelization of an optimization application. If there are any problems, I will let you know.