reduce.hpp

Go to the documentation of this file.

// Copyright (c) 2020-2023 Simons Foundation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0.txt
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// Authors: Olivier Parcollet, Nils Wentzell

 
#pragma once
 
#include "../basic_functions.hpp"
#include "../concepts.hpp"
#include "../exceptions.hpp"
#include "../map.hpp"
#include "../traits.hpp"
 
#include <mpi/mpi.hpp>
 
#include <cstdlib>
#include <type_traits>
#include <utility>

template <nda::Array A>
struct mpi::lazy<mpi::tag::reduce, A> {
  using value_type = typename std::decay_t<A>::value_type;

  using const_view_type = decltype(std::declval<const A>()());

  const_view_type rhs;

  mpi::communicator comm;

  const int root{0}; // NOLINT (const is fine here)

  const bool all{false}; // NOLINT (const is fine here)

  const MPI_Op op{MPI_SUM}; // NOLINT (const is fine here)

  [[nodiscard]] auto shape() const { return rhs.shape(); }

  template <nda::Array T>
  void invoke(T &&target) const { // NOLINT (temporary views are allowed here)
    // check if the arrays can be used in the MPI call
    if (not target.is_contiguous()) NDA_RUNTIME_ERROR << "Error in MPI reduce for nda::Array: Target array needs to be contiguous";
    static_assert(std::decay_t<A>::layout_t::stride_order_encoded == std::decay_t<T>::layout_t::stride_order_encoded,
                  "Error in MPI reduce for nda::Array: Incompatible stride orders");
 
    // special case for non-mpi runs
    if (not mpi::has_env) {
      target = rhs;
      return;
    }
 
    // perform the reduction
    if constexpr (not mpi::has_mpi_type<value_type>) {
      // if the value type cannot be reduced directly, we call mpi::reduce for each element
      target = nda::map([this](auto const &x) { return mpi::reduce(x, this->comm, this->root, this->all, this->op); })(rhs);
    } else {
      // value type has a corresponding MPI type
      bool in_place = (target.data() == rhs.data());
      if (in_place) {
        if (rhs.size() != target.size())
          NDA_RUNTIME_ERROR << "Error in MPI reduce for nda::Array: In-place reduction requires arrays of the same size";
      } else {
        if ((comm.rank() == root) || all) nda::resize_or_check_if_view(target, shape());
        if (std::abs(target.data() - rhs.data()) < rhs.size()) NDA_RUNTIME_ERROR << "Error in MPI reduce for nda::Array: Overlapping arrays";
      }
 
      void *target_ptr    = (void *)target.data();
      void *rhs_ptr       = (void *)rhs.data();
      auto count          = rhs.size();
      auto mpi_value_type = mpi::mpi_type<value_type>::get();
      if (!all) {
        if (in_place)
          MPI_Reduce((comm.rank() == root ? MPI_IN_PLACE : rhs_ptr), rhs_ptr, count, mpi_value_type, op, root, comm.get());
        else
          MPI_Reduce(rhs_ptr, target_ptr, count, mpi_value_type, op, root, comm.get());
      } else {
        if (in_place)
          MPI_Allreduce(MPI_IN_PLACE, rhs_ptr, count, mpi_value_type, op, comm.get());
        else
          MPI_Allreduce(rhs_ptr, target_ptr, count, mpi_value_type, op, comm.get());
      }
    }
  }
};
 
namespace nda {

  template <typename A>
  ArrayInitializer<std::remove_reference_t<A>> auto mpi_reduce(A &&a, mpi::communicator comm = {}, int root = 0, bool all = false,
                                                               MPI_Op op = MPI_SUM)
    requires(is_regular_or_view_v<A>)
  {
    if (not a.is_contiguous()) NDA_RUNTIME_ERROR << "Error in MPI reduce for nda::Array: Array needs to be contiguous";
    return mpi::lazy<mpi::tag::reduce, A>{std::forward<A>(a), comm, root, all, op};
  }
 
} // namespace nda