Zoltan2
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
kokkosBlock.cpp
Go to the documentation of this file.
1 // @HEADER
2 //
3 // ***********************************************************************
4 //
5 // Zoltan2: A package of combinatorial algorithms for scientific computing
6 // Copyright 2012 Sandia Corporation
7 //
8 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9 // the U.S. Government retains certain rights in this software.
10 //
11 // Redistribution and use in source and binary forms, with or without
12 // modification, are permitted provided that the following conditions are
13 // met:
14 //
15 // 1. Redistributions of source code must retain the above copyright
16 // notice, this list of conditions and the following disclaimer.
17 //
18 // 2. Redistributions in binary form must reproduce the above copyright
19 // notice, this list of conditions and the following disclaimer in the
20 // documentation and/or other materials provided with the distribution.
21 //
22 // 3. Neither the name of the Corporation nor the names of the
23 // contributors may be used to endorse or promote products derived from
24 // this software without specific prior written permission.
25 //
26 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 //
38 // Questions? Contact Karen Devine (kddevin@sandia.gov)
39 // Erik Boman (egboman@sandia.gov)
40 // Siva Rajamanickam (srajama@sandia.gov)
41 //
42 // ***********************************************************************
43 //
44 // @HEADER
45 
50 #include <Kokkos_Core.hpp>
51 #include <Teuchos_DefaultComm.hpp>
55 
56 using Teuchos::Comm;
57 using Teuchos::RCP;
58 
65 int main(int narg, char *arg[]) {
66  Tpetra::ScopeGuard tscope(&narg, &arg);
67  Teuchos::RCP<const Teuchos::Comm<int> > comm = Tpetra::getDefaultComm();
68 
69  int rank = comm->getRank();
70  int nprocs = comm->getSize();
71 
72  // For convenience, we'll use the Tpetra defaults for local/global ID types
73  // Users can substitute their preferred local/global ID types
74  typedef Tpetra::Map<> Map_t;
75  typedef Map_t::local_ordinal_type localId_t;
76  typedef Map_t::global_ordinal_type globalId_t;
77  typedef Tpetra::Details::DefaultTypes::scalar_type scalar_t;
78 
80  // Generate some input data.
81 
82  int localCount = 40 * (rank + 1);
83  int totalCount = 20 * nprocs * (nprocs + 1);
84  int targetCount = totalCount / nprocs;
85  Kokkos::View<globalId_t*> globalIds("globalIds", localCount);
86 
87  if (rank == 0) {
88  for (int i = 0, num = 40; i < nprocs ; i++, num += 40) {
89  std::cout << "Rank " << i << " generates " << num << " ids." << std::endl;
90  }
91  }
92 
93  globalId_t offset = 0;
94  for (int i = 1; i <= rank; i++) {
95  offset += 40 * i;
96  }
97 
98  for (int i = 0; i < localCount; i++) {
99  globalIds(i) = offset++;
100  }
101 
103  // Create a Zoltan2 input adapter with no weights
104 
106  typedef Zoltan2::BasicKokkosIdentifierAdapter<myTypes> inputAdapter_t;
108 
109  const int nWeights = 1;
110  Kokkos::View<scalar_t **, Layout> weights("weights", localCount, nWeights);
111  for (int index = 0; index < localCount; index++) {
112  weights(index, 0) = 1; // Error check relies on uniform weights
113  }
114 
115  inputAdapter_t ia(globalIds, weights);
116 
118  // Create parameters for a Block problem
119 
120  Teuchos::ParameterList params("test params");
121  params.set("debug_level", "basic_status");
122  params.set("debug_procs", "0");
123  params.set("error_check_level", "debug_mode_assertions");
124 
125  params.set("algorithm", "block");
126  params.set("imbalance_tolerance", 1.1);
127  params.set("num_global_parts", nprocs);
128 
130  // Create a Zoltan2 partitioning problem
131 
134 
136  // Solve the problem - do the partitioning
137 
138  problem->solve();
139 
141  // Check and print the solution.
142  // Count number of IDs assigned to each part; compare to targetCount
143 
144  Kokkos::View<globalId_t *> ids;
145  ia.getIDsKokkosView(ids);
146 
147  Kokkos::View<int*> partCounts("partCounts", nprocs);
148 
149  Kokkos::View<int*> globalPartCounts("globalPartCounts", nprocs);
150 
151  for (size_t i = 0; i < ia.getLocalNumIDs(); i++) {
152  int pp = problem->getSolution().getPartListView()[i];
153  std::cout << rank << " LID " << i << " GID " << ids(i)
154  << " PART " << pp << std::endl;
155  partCounts(pp)++;
156  }
157 
158  Teuchos::reduceAll<int, int>(*comm, Teuchos::REDUCE_SUM, nprocs,
159  &partCounts(0), &globalPartCounts(0));
160 
161  if (rank == 0) {
162  int ierr = 0;
163  for (int i = 0; i < nprocs; i++) {
164  if (globalPartCounts(i) != targetCount) {
165  std::cout << "FAIL: part " << i << " has " << globalPartCounts(i)
166  << " != " << targetCount << "; " << ++ierr << " errors"
167  << std::endl;
168  }
169  }
170  if (ierr == 0) {
171  std::cout << "PASS" << std::endl;
172  }
173  }
174 
175  delete problem;
176 }
177 
int main(int narg, char *arg[])
A simple class that can be the User template argument for an InputAdapter.
static ArrayRCP< ArrayRCP< zscalar_t > > weights
Defines the PartitioningSolution class.
This class represents a collection of global Identifiers and their associated weights, if any.
Defines the BasicKokkosIdentifierAdapter class.
const PartitioningSolution< Adapter > & getSolution()
Get the solution to the problem.
PartitioningProblem sets up partitioning problems for the user.
Defines the PartitioningProblem class.
void solve(bool updateInputData=true)
Direct the problem to create a solution.