Add DistributedTree Nearest query with callback #737
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,3 @@ | ||
| add_executable(ArborX_DistributedTree_KNNCallback.exe distributed_knn_callback.cpp) | ||
| target_link_libraries(ArborX_DistributedTree_KNNCallback.exe ArborX::ArborX) | ||
| add_test(NAME ArborX_DistributedTree_KNNCallback_Example COMMAND ${MPIEXEC_EXECUTABLE} ${MPIEXEC_NUMPROC_FLAG} ${MPIEXEC_MAX_NUMPROCS} ${MPIEXEC_PREFLAGS} ./ArborX_DistributedTree_KNNCallback.exe ${MPIEXEC_POSTFLAGS}) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,139 @@ | ||
| /**************************************************************************** | ||
| * Copyright (c) 2017-2022 by the ArborX authors * | ||
| * All rights reserved. * | ||
| * * | ||
| * This file is part of the ArborX library. ArborX is * | ||
| * distributed under a BSD 3-clause license. For the licensing terms see * | ||
| * the LICENSE file in the top-level directory. * | ||
| * * | ||
| * SPDX-License-Identifier: BSD-3-Clause * | ||
| ****************************************************************************/ | ||
|
|
||
| #include <ArborX.hpp> | ||
|
|
||
| #include <Kokkos_Core.hpp> | ||
|
|
||
| #include <cstdarg> | ||
| #include <cstdio> | ||
| #include <iostream> | ||
| #include <random> | ||
| #include <vector> | ||
|
|
||
| #include <mpi.h> | ||
|
|
||
| using ExecutionSpace = Kokkos::DefaultExecutionSpace; | ||
| using MemorySpace = ExecutionSpace::memory_space; | ||
|
|
||
| namespace Example | ||
| { | ||
| template <class Points> | ||
| struct Nearest | ||
| { | ||
| Points points; | ||
| int k; | ||
| int mpi_rank; | ||
| }; | ||
| template <class Points> | ||
| Nearest(Points const &, int, int) -> Nearest<Points>; | ||
|
|
||
| struct IndexAndRank | ||
| { | ||
| int index; | ||
| int rank; | ||
| }; | ||
|
|
||
| template <typename DeviceType> | ||
| struct PrintAndInsert | ||
| { | ||
| Kokkos::View<ArborX::Point *, DeviceType> points; | ||
| int mpi_rank; | ||
|
|
||
| PrintAndInsert(Kokkos::View<ArborX::Point *, DeviceType> const &points_, | ||
| int mpi_rank_) | ||
| : points(points_) | ||
| , mpi_rank(mpi_rank_) | ||
| {} | ||
|
|
||
| template <typename Predicate, typename OutputFunctor> | ||
| KOKKOS_FUNCTION void operator()([[maybe_unused]] Predicate const &predicate, | ||
| int primitive_index, | ||
| OutputFunctor const &out) const | ||
| { | ||
| #ifndef KOKKOS_ENABLE_SYCL | ||
| auto data = ArborX::getData(predicate); | ||
| auto const &point = points(primitive_index); | ||
| printf("Match for query %d from MPI rank %d on MPI rank %d for " | ||
| "point %f,%f,%f with index %d\n", | ||
| data.index, data.rank, mpi_rank, point[0], point[1], point[2], | ||
| primitive_index); | ||
| #endif | ||
|
|
||
| out({primitive_index, mpi_rank}); | ||
| } | ||
| }; | ||
|
|
||
| } // namespace Example | ||
|
|
||
| template <class Points> | ||
| struct ArborX::AccessTraits<Example::Nearest<Points>, ArborX::PredicatesTag> | ||
| { | ||
| static KOKKOS_FUNCTION std::size_t size(Example::Nearest<Points> const &x) | ||
| { | ||
| return x.points.extent(0); | ||
| } | ||
| static KOKKOS_FUNCTION auto get(Example::Nearest<Points> const &x, int i) | ||
| { | ||
| return attach(ArborX::nearest(x.points(i), x.k), | ||
| Example::IndexAndRank{i, x.mpi_rank}); | ||
| } | ||
| using memory_space = MemorySpace; | ||
| }; | ||
|
|
||
| int main(int argc, char *argv[]) | ||
| { | ||
| MPI_Init(&argc, &argv); | ||
| Kokkos::initialize(argc, argv); | ||
| { | ||
| MPI_Comm comm = MPI_COMM_WORLD; | ||
| int comm_rank; | ||
| MPI_Comm_rank(comm, &comm_rank); | ||
| int comm_size; | ||
| MPI_Comm_size(comm, &comm_size); | ||
| ArborX::Point lower_left_corner = {static_cast<float>(comm_rank), | ||
| static_cast<float>(comm_rank), | ||
| static_cast<float>(comm_rank)}; | ||
| ArborX::Point center = {static_cast<float>(comm_rank) + .5f, | ||
| static_cast<float>(comm_rank) + .5f, | ||
| static_cast<float>(comm_rank) + .5f}; | ||
| std::vector points = {lower_left_corner, center}; | ||
| auto points_device = Kokkos::create_mirror_view_and_copy( | ||
| MemorySpace{}, | ||
| Kokkos::View<ArborX::Point *, Kokkos::HostSpace, | ||
| Kokkos::MemoryUnmanaged>(points.data(), points.size())); | ||
|
|
||
| ExecutionSpace exec; | ||
| ArborX::DistributedTree<MemorySpace> tree(comm, exec, points_device); | ||
|
|
||
| Kokkos::View<Example::IndexAndRank *, MemorySpace> values("values", 0); | ||
| Kokkos::View<int *, MemorySpace> offsets("offsets", 0); | ||
| tree.query(exec, Example::Nearest{points_device, 3, comm_rank}, | ||
| Example::PrintAndInsert<MemorySpace>(points_device, comm_rank), | ||
| values, offsets); | ||
|
|
||
| auto host_values = | ||
| Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace{}, values); | ||
| auto host_offsets = | ||
| Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace{}, offsets); | ||
| for (unsigned int i = 0; i + 1 < host_offsets.size(); ++i) | ||
| { | ||
| std::cout << "Results for query " << i << " on MPI rank " << comm_rank | ||
| << '\n'; | ||
| for (int j = host_offsets(i); j < host_offsets(i + 1); ++j) | ||
| std::cout << "point " << host_values(j).index << ", rank " | ||
| << host_values(j).rank << std::endl; | ||
| } | ||
| } | ||
| Kokkos::finalize(); | ||
| MPI_Finalize(); | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This function is deprecated, need to use the one that returns pairs of (index, rank).
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
No, the
ImplversionqueryDispatchImplis not deprecated (and I rather use this one internally).