DOLFINx 0.9.0
DOLFINx C++ interface
Loading...
Searching...
No Matches
partition.h
1// Copyright (C) 2020 Garth N. Wells
2//
3// This file is part of DOLFINx (https://www.fenicsproject.org)
4//
5// SPDX-License-Identifier: LGPL-3.0-or-later
6
7#pragma once
8
9#include "AdjacencyList.h"
10#include <algorithm>
11#include <cstdint>
12#include <functional>
13#include <mpi.h>
14#include <span>
15#include <utility>
16#include <vector>
17
18#include <iostream>
19
20namespace dolfinx::graph
21{
31using partition_fn = std::function<graph::AdjacencyList<std::int32_t>(
32 MPI_Comm, int, const AdjacencyList<std::int64_t>&, bool)>;
33
45partition_graph(MPI_Comm comm, int nparts,
46 const AdjacencyList<std::int64_t>& local_graph, bool ghosting);
47
51namespace build
52{
67std::tuple<graph::AdjacencyList<std::int64_t>, std::vector<int>,
68 std::vector<std::int64_t>, std::vector<int>>
69distribute(MPI_Comm comm, const graph::AdjacencyList<std::int64_t>& list,
70 const graph::AdjacencyList<std::int32_t>& destinations);
71
89std::tuple<std::vector<std::int64_t>, std::vector<int>,
90 std::vector<std::int64_t>, std::vector<int>>
91distribute(MPI_Comm comm, std::span<const std::int64_t> list,
92 std::array<std::size_t, 2> shape,
93 const graph::AdjacencyList<std::int32_t>& destinations);
94
118std::vector<std::int64_t>
119compute_ghost_indices(MPI_Comm comm,
120 std::span<const std::int64_t> owned_indices,
121 std::span<const std::int64_t> ghost_indices,
122 std::span<const int> ghost_owners);
123
134std::vector<std::int64_t>
135compute_local_to_global(std::span<const std::int64_t> global,
136 std::span<const std::int32_t> local);
137
146std::vector<std::int32_t>
147compute_local_to_local(std::span<const std::int64_t> local0_to_global,
148 std::span<const std::int64_t> local1_to_global);
149} // namespace build
150
151} // namespace dolfinx::graph
Definition topologycomputation.h:24
std::vector< std::int64_t > compute_ghost_indices(MPI_Comm comm, std::span< const std::int64_t > owned_indices, std::span< const std::int64_t > ghost_indices, std::span< const int > ghost_owners)
Take a set of distributed input global indices, including ghosts, and determine the new global indice...
Definition partition.cpp:394
std::vector< std::int64_t > compute_local_to_global(std::span< const std::int64_t > global, std::span< const std::int32_t > local)
Definition partition.cpp:534
std::tuple< graph::AdjacencyList< std::int64_t >, std::vector< int >, std::vector< std::int64_t >, std::vector< int > > distribute(MPI_Comm comm, const graph::AdjacencyList< std::int64_t > &list, const graph::AdjacencyList< std::int32_t > &destinations)
Distribute adjacency list nodes to destination ranks.
Definition partition.cpp:38
std::vector< std::int32_t > compute_local_to_local(std::span< const std::int64_t > local0_to_global, std::span< const std::int64_t > local1_to_global)
Compute a local0-to-local1 map from two local-to-global maps with common global indices.
Definition partition.cpp:556
Graph data structures and algorithms.
Definition dofmapbuilder.h:26
std::function< graph::AdjacencyList< std::int32_t >( MPI_Comm, int, const AdjacencyList< std::int64_t > &, bool)> partition_fn
Signature of functions for computing the parallel partitioning of a distributed graph.
Definition partition.h:31
AdjacencyList< std::int32_t > partition_graph(MPI_Comm comm, int nparts, const AdjacencyList< std::int64_t > &local_graph, bool ghosting)
Partition graph across processes using the default graph partitioner.
Definition partition.cpp:21