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
|
//@HEADER
// ************************************************************************
//
// Kokkos v. 4.0
// Copyright (2022) National Technology & Engineering
// Solutions of Sandia, LLC (NTESS).
//
// Under the terms of Contract DE-NA0003525 with NTESS,
// the U.S. Government retains certain rights in this software.
//
// Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions.
// See https://kokkos.org/LICENSE for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//@HEADER
// @Kokkos_Feature_Level_Required:11
// Unit test for hierarchical parallelism
// Create concurrent work hierarchically and verify if
// contributions of paticipating processing units corresponds to expected value
#include <gtest/gtest.h>
#include <Kokkos_Core.hpp>
namespace Test {
template <class ExecSpace>
struct Hierarchical_ForLoop_A {
void run(const int pN, const int sX, const int sY) {
using team_policy = Kokkos::TeamPolicy<ExecSpace>;
using member_type = typename Kokkos::TeamPolicy<ExecSpace>::member_type;
using viewDataType = Kokkos::View<int **, ExecSpace>;
viewDataType v("Matrix", sX, sY);
Kokkos::parallel_for(
"Team", team_policy(pN, Kokkos::AUTO),
KOKKOS_LAMBDA(const member_type &team) {
const int n = team.league_rank();
const int ls = team.league_size();
const int startDim1 = n * (int)(sX / ls);
const int modDim1 = n == ls - 1 ? sX % ls : 0;
Kokkos::parallel_for(
Kokkos::TeamThreadRange(team, v.extent(1)), [=](const int m) {
for (int i = startDim1;
i < (startDim1 + (int)(sX / ls) + modDim1); ++i)
v(i, m) = i * v.extent(1) + m;
});
});
Kokkos::fence();
auto v_H = Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace(), v);
long long int check = 0;
const long long int s = static_cast<long long int>(sY) * sX;
for (int i = 0; i < sX; ++i)
for (int j = 0; j < sY; ++j) check += v_H(i, j);
ASSERT_EQ(check, s * (s - 1) / 2);
}
};
TEST(TEST_CATEGORY, IncrTest_11a_Hierarchical_ForLoop) {
Hierarchical_ForLoop_A<TEST_EXECSPACE> test;
test.run(4, 5, 200);
test.run(4, 7, 19);
test.run(14, 277, 321);
}
} // namespace Test
|