1 /*
2 //@HEADER
3 // ************************************************************************
4 //
5 //                        Kokkos v. 3.0
6 //       Copyright (2020) National Technology & Engineering
7 //               Solutions of Sandia, LLC (NTESS).
8 //
9 // Under the terms of Contract DE-NA0003525 with NTESS,
10 // the U.S. Government retains certain rights in this software.
11 //
12 // Redistribution and use in source and binary forms, with or without
13 // modification, are permitted provided that the following conditions are
14 // met:
15 //
16 // 1. Redistributions of source code must retain the above copyright
17 // notice, this list of conditions and the following disclaimer.
18 //
19 // 2. Redistributions in binary form must reproduce the above copyright
20 // notice, this list of conditions and the following disclaimer in the
21 // documentation and/or other materials provided with the distribution.
22 //
23 // 3. Neither the name of the Corporation nor the names of the
24 // contributors may be used to endorse or promote products derived from
25 // this software without specific prior written permission.
26 //
27 // THIS SOFTWARE IS PROVIDED BY NTESS "AS IS" AND ANY
28 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NTESS OR THE
31 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
32 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
33 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
34 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
35 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
36 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
37 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 //
39 // Questions? Contact Christian R. Trott (crtrott@sandia.gov)
40 //
41 // ************************************************************************
42 //@HEADER
43 */
44 
45 // @Kokkos_Feature_Level_Required:11
46 // Unit test for hierarchical parallelism
47 // Create concurrent work hierarchically and verify if
48 // contributions of paticipating processing units corresponds to expected value
49 
50 #include <gtest/gtest.h>
51 #include <Kokkos_Core.hpp>
52 
53 namespace Test {
54 
55 template <class ExecSpace>
56 struct Hierarchical_ForLoop_C {
runTest::Hierarchical_ForLoop_C57   void run(const int pN, const int sX, const int sY, const int sZ) {
58     using team_policy = Kokkos::TeamPolicy<ExecSpace>;
59     using member_type = typename Kokkos::TeamPolicy<ExecSpace>::member_type;
60 
61     using viewDataType = Kokkos::View<size_t ***, ExecSpace>;
62     viewDataType v("Matrix", sX, sY, sZ);
63 
64     Kokkos::parallel_for(
65         "Team", team_policy(pN, Kokkos::AUTO),
66         KOKKOS_LAMBDA(const member_type &team) {
67           int n  = team.league_rank();
68           int ls = team.league_size();
69 
70           int startDim1 = n * (int)(sX / ls);
71           int modDim1   = n == ls - 1 ? sX % ls : 0;
72 
73           Kokkos::parallel_for(
74               Kokkos::TeamThreadRange(team, v.extent(1)), [&](const int m) {
75                 Kokkos::parallel_for(
76                     Kokkos::ThreadVectorRange(team, v.extent(2)),
77                     [&](const int k) {
78                       for (int i = startDim1;
79                            i < (startDim1 + (int)(sX / ls) + modDim1); ++i)
80                         v(i, m, k) =
81                             i * v.extent(1) * v.extent(2) + m * v.extent(2) + k;
82                     });
83               });
84         });
85 
86     Kokkos::fence();
87     auto v_H = Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace(), v);
88 
89     size_t check   = 0;
90     const size_t s = sX * sY * sZ;
91     for (int i = 0; i < sX; ++i)
92       for (int j = 0; j < sY; ++j)
93         for (int k = 0; k < sZ; ++k) check += v_H(i, j, k);
94     ASSERT_EQ(check, s * (s - 1) / 2);
95   }
96 };
97 
TEST(TEST_CATEGORY,IncrTest_11c_Hierarchical_ForLoop)98 TEST(TEST_CATEGORY, IncrTest_11c_Hierarchical_ForLoop) {
99   Hierarchical_ForLoop_C<TEST_EXECSPACE> test;
100   test.run(4, 16, 16, 16);
101   test.run(8, 12, 333, 16);
102   test.run(12, 277, 321, 345);
103 }
104 
105 }  // namespace Test
106