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:10
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 HierarchicalBasics {
57   using policy_t = Kokkos::TeamPolicy<ExecSpace>;
58   using team_t   = typename policy_t::member_type;
59 
runTest::HierarchicalBasics60   void run(const int nP, int nT) {
61     if (nT > ExecSpace::concurrency()) nT = ExecSpace::concurrency();
62 
63     policy_t pol(nP, nT);
64 
65     ASSERT_EQ(pol.league_size(), nP);
66     ASSERT_LE(pol.team_size(), nT);
67 
68     nT = pol.team_size();
69 
70     Kokkos::View<int **, ExecSpace> v("Array_A", nP, nT);
71     Kokkos::parallel_for(
72         "Teams", pol, KOKKOS_LAMBDA(const team_t &team) {
73           const int tR = team.team_rank();
74           const int tS = team.team_size();
75           const int lR = team.league_rank();
76           const int lS = team.league_size();
77           if (lR < lS) {
78             v(lR, tR) = lR * tS + tR;
79           } else {
80             v(lR, tR) = 100000;
81           }
82         });
83     Kokkos::fence();
84     auto h_v = Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace(), v);
85 
86     size_t check = 0;
87     size_t ref   = nP * nT;
88     for (int i = 0; i < nP; ++i)
89       for (int j = 0; j < nT; ++j) check += h_v(i, j);
90 
91     ASSERT_EQ(check, ref * (ref - 1) / 2);
92   }
93 };
94 
TEST(TEST_CATEGORY,IncrTest_10_Hierarchical_Basics)95 TEST(TEST_CATEGORY, IncrTest_10_Hierarchical_Basics) {
96   HierarchicalBasics<TEST_EXECSPACE> test;
97 
98   // OpenMPTarget backend only accepts >= 32 threads per team
99 #if defined(KOKKOS_ENABLE_OPENMPTARGET)
100   test.run(1, 32);
101   test.run(8, 64);
102   test.run(11, 128);
103 #else
104   test.run(1, 4);
105   test.run(8, 16);
106   test.run(11, 13);
107 #endif
108 }
109 
110 }  // namespace Test
111