/
ArborX_DistributedTree.hpp
201 lines (164 loc) · 7.86 KB
/
ArborX_DistributedTree.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
/****************************************************************************
* 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 *
****************************************************************************/
#ifndef ARBORX_DISTRIBUTED_TREE_HPP
#define ARBORX_DISTRIBUTED_TREE_HPP
#include <ArborX_AccessTraits.hpp>
#include <ArborX_Box.hpp>
#include <ArborX_DetailsDistributedTreeNearest.hpp>
#include <ArborX_DetailsDistributedTreeSpatial.hpp>
#include <ArborX_DetailsKokkosExtStdAlgorithms.hpp>
#include <ArborX_LinearBVH.hpp>
#include <Kokkos_Core.hpp>
#include <memory>
#include <mpi.h>
namespace ArborX
{
// NOTE: query() must be called as collective over all processes in the
// communicator passed to the constructor
template <typename MemorySpace>
class DistributedTree
{
public:
using memory_space = MemorySpace;
static_assert(Kokkos::is_memory_space<MemorySpace>::value);
using size_type = typename BVH<MemorySpace>::size_type;
using bounding_volume_type = typename BVH<MemorySpace>::bounding_volume_type;
template <typename ExecutionSpace, typename Primitives>
DistributedTree(MPI_Comm comm, ExecutionSpace const &space,
Primitives const &primitives);
// Return the smallest axis-aligned box able to contain all the objects
// stored in the tree or an invalid box if the tree is empty.
bounding_volume_type bounds() const noexcept { return _top_tree.bounds(); }
// Return the global number of objects stored in the tree
size_type size() const noexcept { return _top_tree_size; }
// Indicate whether the tree is empty on all processes
bool empty() const noexcept { return size() == 0; }
// Find objects satisfying the passed predicates (e.g. nearest to some point
// or intersecting with some box)
//
// This query function performs a batch of spatial or k-nearest neighbors
// searches. The results give indices of the objects that satisfy predicates
// (as given to the constructor). They are organized in a distributed
// compressed row storage format.
//
// `indices` stores the indices of the objects that satisfy the predicates.
// `offset` stores the locations in the `indices` view that start a
// predicate, that is, "queries(q)" is satisfied by `indices(o)` for
// `objects(q) <= o < objects(q+1)` that live on processes `ranks(o)`
// respectively. Following the usual convention, `offset(n) = nnz`, where
// `n` is the number of queries that were performed and `nnz` is the total
// number of collisions.
template <typename ExecutionSpace, typename UserPredicates, typename... Args>
void query(ExecutionSpace const &space, UserPredicates const &user_predicates,
Args &&...args) const
{
static_assert(
Details::KokkosExt::is_accessible_from<MemorySpace,
ExecutionSpace>::value);
using Predicates = Details::AccessValues<UserPredicates, PredicatesTag>;
static_assert(Details::KokkosExt::is_accessible_from<
typename Predicates::memory_space, ExecutionSpace>::value,
"Predicates must be accessible from the execution space");
Predicates predicates{user_predicates};
using Tag = typename Predicates::value_type::Tag;
Details::DistributedTreeImpl::queryDispatch(Tag{}, *this, space, predicates,
std::forward<Args>(args)...);
}
private:
friend struct Details::DistributedTreeImpl;
MPI_Comm getComm() const { return *_comm_ptr; }
std::shared_ptr<MPI_Comm> _comm_ptr;
BVH<MemorySpace> _top_tree; // replicated
BVH<MemorySpace> _bottom_tree; // local
size_type _top_tree_size;
Kokkos::View<size_type *, MemorySpace> _bottom_tree_sizes;
};
template <typename MemorySpace>
template <typename ExecutionSpace, typename Primitives>
DistributedTree<MemorySpace>::DistributedTree(MPI_Comm comm,
ExecutionSpace const &space,
Primitives const &primitives)
{
Kokkos::Profiling::pushRegion("ArborX::DistributedTree::DistributedTree");
static_assert(Kokkos::is_execution_space<ExecutionSpace>::value);
// Create new context for the library to isolate library's communication from
// user's
_comm_ptr.reset(
// duplicate the communicator and store it in a std::shared_ptr so that
// all copies of the distributed tree point to the same object
[comm]() {
auto p = std::make_unique<MPI_Comm>();
MPI_Comm_dup(comm, p.get());
return p.release();
}(),
// custom deleter to mark the communicator object for deallocation
[](MPI_Comm *p) {
MPI_Comm_free(p);
delete p;
});
Kokkos::Profiling::pushRegion("ArborX::DistributedTree::DistributedTree::"
"bottom_tree_construction");
_bottom_tree = BVH<MemorySpace>(space, primitives);
Kokkos::Profiling::popRegion();
Kokkos::Profiling::pushRegion("ArborX::DistributedTree::DistributedTree::"
"top_tree_construction");
int comm_rank;
MPI_Comm_rank(getComm(), &comm_rank);
int comm_size;
MPI_Comm_size(getComm(), &comm_size);
Kokkos::View<Box *, MemorySpace> boxes(
Kokkos::view_alloc(space, Kokkos::WithoutInitializing,
"ArborX::DistributedTree::DistributedTree::"
"rank_bounding_boxes"),
comm_size);
Kokkos::DefaultHostExecutionSpace host_exec;
#ifdef ARBORX_ENABLE_GPU_AWARE_MPI
Kokkos::deep_copy(space, Kokkos::subview(boxes, comm_rank),
_bottom_tree.bounds());
space.fence("ArborX::DistributedTree::DistributedTree"
" (fill on device done before MPI_Allgather)");
MPI_Allgather(MPI_IN_PLACE, 0, MPI_DATATYPE_NULL,
static_cast<void *>(boxes.data()), sizeof(Box), MPI_BYTE,
getComm());
#else
auto boxes_host = Kokkos::create_mirror_view(
Kokkos::view_alloc(host_exec, Kokkos::WithoutInitializing), boxes);
host_exec.fence();
boxes_host(comm_rank) = _bottom_tree.bounds();
MPI_Allgather(MPI_IN_PLACE, 0, MPI_DATATYPE_NULL,
static_cast<void *>(boxes_host.data()), sizeof(Box), MPI_BYTE,
getComm());
Kokkos::deep_copy(space, boxes, boxes_host);
#endif
_top_tree = BVH<MemorySpace>{space, boxes};
Kokkos::Profiling::popRegion();
Kokkos::Profiling::pushRegion("ArborX::DistributedTree::DistributedTree::"
"size_calculation");
_bottom_tree_sizes = Kokkos::View<size_type *, MemorySpace>(
Kokkos::view_alloc(space, Kokkos::WithoutInitializing,
"ArborX::DistributedTree::"
"leave_count_in_local_trees"),
comm_size);
auto bottom_tree_sizes_host = Kokkos::create_mirror_view(
Kokkos::view_alloc(host_exec, Kokkos::WithoutInitializing),
_bottom_tree_sizes);
host_exec.fence();
bottom_tree_sizes_host(comm_rank) = _bottom_tree.size();
MPI_Allgather(MPI_IN_PLACE, 0, MPI_DATATYPE_NULL,
static_cast<void *>(bottom_tree_sizes_host.data()),
sizeof(size_type), MPI_BYTE, getComm());
Kokkos::deep_copy(space, _bottom_tree_sizes, bottom_tree_sizes_host);
_top_tree_size = Details::KokkosExt::reduce(space, _bottom_tree_sizes, 0);
Kokkos::Profiling::popRegion();
Kokkos::Profiling::popRegion();
}
} // namespace ArborX
#endif