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 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
|
/*
* This file is a part of TiledArray.
* Copyright (C) 2013 Virginia Tech
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Justus Calvin
* Department of Chemistry, Virginia Tech
*
* proc_grid.cpp
* Nov 13, 2013
*
*/
// Enable the testing constructor
#define TILEDARRAY_ENABLE_TEST_PROC_GRID
#include "TiledArray/proc_grid.h"
#include "tiledarray.h"
#include "unit_test_config.h"
struct ProcGridFixture {
ProcGridFixture() {}
~ProcGridFixture() {}
}; // Fixture
BOOST_FIXTURE_TEST_SUITE(proc_grid_suite, ProcGridFixture)
BOOST_AUTO_TEST_CASE(random_constructor_test) {
GlobalFixture::world->srand(time(NULL));
for (int test = 0; test < 100; ++test) {
// Generate random process and matrix sizes
const ProcessID nprocs = GlobalFixture::world->rand() % 4095 + 1;
const std::size_t rows = GlobalFixture::world->rand() % 1023 + 1;
const std::size_t cols = GlobalFixture::world->rand() % 1023 + 1;
const std::size_t size = rows * cols;
const std::size_t row_size =
rows * ((GlobalFixture::world->rand() % 511) + 1);
const std::size_t col_size =
cols * ((GlobalFixture::world->rand() % 512) + 1);
TiledArray::detail::ProcGrid proc_grid0(*GlobalFixture::world, 0, nprocs,
rows, cols, row_size, col_size);
// Check tile dimensions and sizes
BOOST_CHECK_EQUAL(proc_grid0.rows(), rows);
BOOST_CHECK_EQUAL(proc_grid0.cols(), cols);
BOOST_CHECK_EQUAL(proc_grid0.size(), size);
// Check process grid sizes
BOOST_CHECK_LE(proc_grid0.proc_size(), nprocs);
BOOST_CHECK_EQUAL(proc_grid0.proc_size(),
proc_grid0.proc_rows() * proc_grid0.proc_cols());
// Check that process rows are within limits
BOOST_CHECK_GE(proc_grid0.proc_rows(), 1ul);
BOOST_CHECK_LE(proc_grid0.proc_rows(), rows);
BOOST_CHECK_LE(proc_grid0.proc_rows(), nprocs);
// Check that process columns are within limits
BOOST_CHECK_GE(proc_grid0.proc_cols(), 1ul);
BOOST_CHECK_LE(proc_grid0.proc_cols(), cols);
BOOST_CHECK_LE(proc_grid0.proc_cols(), nprocs);
// Check process grid rank
BOOST_CHECK_EQUAL(proc_grid0.rank_row(), 0);
BOOST_CHECK_EQUAL(proc_grid0.rank_col(), 0);
// Accumulate the number of local elements on each node
std::size_t local_rows = proc_grid0.local_rows();
std::size_t local_cols = proc_grid0.local_cols();
std::size_t local_size = proc_grid0.local_size();
// Check that the process grids on other ranks match what was obtained on
// rank 0.
ProcessID rank = 0;
for (std::size_t rank_row = 0; rank_row < proc_grid0.proc_rows();
++rank_row) {
for (std::size_t rank_col = 0; rank_col < proc_grid0.proc_cols();
++rank_col, ++rank) {
// Skip rank 0
if (rank == 0) continue;
// Construct the process grid
TiledArray::detail::ProcGrid proc_grid(*GlobalFixture::world, rank,
nprocs, rows, cols, row_size,
col_size);
// Check tile dimensions and sizes are equal to that of rank 0
BOOST_CHECK_EQUAL(proc_grid.rows(), proc_grid0.rows());
BOOST_CHECK_EQUAL(proc_grid.cols(), proc_grid.cols());
BOOST_CHECK_EQUAL(proc_grid.size(), proc_grid.size());
// Check process grid dimensions are equal for all ranks
BOOST_CHECK_EQUAL(proc_grid0.proc_rows(), proc_grid0.proc_rows());
BOOST_CHECK_EQUAL(proc_grid0.proc_cols(), proc_grid0.proc_cols());
BOOST_CHECK_EQUAL(proc_grid0.proc_size(), proc_grid0.proc_size());
// Check process grid rank
BOOST_CHECK_EQUAL(proc_grid.rank_row(), ProcessID(rank_row));
BOOST_CHECK_EQUAL(proc_grid.rank_col(), ProcessID(rank_col));
// Accumulate the number of local elements on each node
local_rows += proc_grid.local_rows();
local_cols += proc_grid.local_cols();
local_size += proc_grid.local_size();
}
}
// Check that the processes not included in the process grid have
// appropriate values.
for (; rank < nprocs; ++rank) {
TiledArray::detail::ProcGrid proc_grid(
*GlobalFixture::world, rank, nprocs, rows, cols, row_size, col_size);
// Check tile dimensions and sizes are equal to that of rank 0
BOOST_CHECK_EQUAL(proc_grid.rows(), proc_grid0.rows());
BOOST_CHECK_EQUAL(proc_grid.cols(), proc_grid.cols());
BOOST_CHECK_EQUAL(proc_grid.size(), proc_grid.size());
// Check process grid dimensions are equal for all ranks
BOOST_CHECK_EQUAL(proc_grid.proc_rows(), proc_grid0.proc_rows());
BOOST_CHECK_EQUAL(proc_grid.proc_cols(), proc_grid0.proc_cols());
BOOST_CHECK_EQUAL(proc_grid.proc_size(), proc_grid0.proc_size());
// Check process grid rank
BOOST_CHECK_EQUAL(proc_grid.rank_row(), -1);
BOOST_CHECK_EQUAL(proc_grid.rank_col(), -1);
// Accumulate the number of local elements on each node
BOOST_CHECK_EQUAL(proc_grid.local_rows(), 0ul);
BOOST_CHECK_EQUAL(proc_grid.local_cols(), 0ul);
BOOST_CHECK_EQUAL(proc_grid.local_size(), 0ul);
}
// Check that the sum of the local rows and sizes matches the total
BOOST_CHECK_EQUAL(local_rows / proc_grid0.proc_cols(), rows);
BOOST_CHECK_EQUAL(local_cols / proc_grid0.proc_rows(), cols);
BOOST_CHECK_EQUAL(local_size, size);
}
}
BOOST_AUTO_TEST_CASE(make_groups) {
madness::DistributedID did_row(madness::uniqueidT(), 0);
madness::DistributedID did_col(madness::uniqueidT(), 1);
// Construct the process grid
TiledArray::detail::ProcGrid proc_grid(*GlobalFixture::world, 42, 84, 2048,
1024);
// Create the row and column group
madness::Group row_group, col_group;
BOOST_REQUIRE_NO_THROW(row_group = proc_grid.make_row_group(did_row));
BOOST_REQUIRE_NO_THROW(col_group = proc_grid.make_col_group(did_col));
// Check group sizes
BOOST_CHECK_EQUAL(row_group.size(), proc_grid.proc_cols());
BOOST_CHECK_EQUAL(col_group.size(), proc_grid.proc_rows());
// Check that the groups contain the correct processes.
std::size_t rank = 0;
for (std::size_t rank_row = 0; rank_row < proc_grid.proc_rows(); ++rank_row) {
for (std::size_t rank_col = 0; rank_col < proc_grid.proc_cols();
++rank_col, ++rank) {
// Check that the row group includes ranks in this this processes
if (ProcessID(rank_row) == proc_grid.rank_row()) {
BOOST_CHECK_NE(row_group.rank(rank), -1);
} else {
BOOST_CHECK_EQUAL(row_group.rank(rank), -1);
}
// Check that the column group includes the correct ranks
if (ProcessID(rank_col) == proc_grid.rank_col()) {
BOOST_CHECK_NE(col_group.rank(rank), -1);
} else {
BOOST_CHECK_EQUAL(col_group.rank(rank), -1);
}
}
}
}
#if 0
// This test case us used to evaluate distribute statistics. This unit test
// should only be enabled when changes are made to the ProcGrid algorithm, and
// human eyes are examining the output.
BOOST_AUTO_TEST_CASE( statistics )
{
GlobalFixture::world->srand(time(NULL));
double total_time = 0.0;
std::size_t count = 0;
std::vector<std::size_t> unused_process_distribution(100, 0ul);
while(count < 100000) {
const ProcessID nprocs = (GlobalFixture::world->rand() % 16 + 1);
const std::size_t rows = GlobalFixture::world->rand() % 1023 + 1;
const std::size_t cols = GlobalFixture::world->rand() % 1023 + 1;
const std::size_t row_size = rows * ((GlobalFixture::world->rand() % 511) + 1);
const std::size_t col_size = cols * ((GlobalFixture::world->rand() % 512) + 1);
if((rows * cols) < nprocs)
continue;
const double start = madness::wall_time();
TiledArray::detail::ProcGrid proc_grid(*GlobalFixture::world, 0, nprocs,
rows, cols, row_size, col_size);
total_time += madness::wall_time() - start;
++count;
++unused_process_distribution[100ul * (nprocs - proc_grid.proc_size()) / nprocs];
}
for(std::vector<std::size_t>::const_iterator it = unused_process_distribution.begin();
it != unused_process_distribution.end(); ++it)
std::cout << *it << "\n";
std::cout << "\nAverage build time: " << total_time / double(count) << "\n";
}
#endif
#if 0
// This test case us used to evaluate quality of ProcGrid output. This unit test
// should only be enabled when changes are made to the ProcGrid algorithm, and
// human eyes are examining the output.
BOOST_AUTO_TEST_CASE( generate )
{
const std::size_t tile_size = 256;
const std::size_t row_size = 32768;
const std::size_t col_size = 32768;
const std::size_t rows = row_size / tile_size;
const std::size_t cols = col_size / tile_size;
std::cout << "\n Matrix size = " << row_size << "x" << col_size << "\n blocksize = "
<< tile_size << "x" << tile_size << "\n";
for(ProcessID nprocs = 1; nprocs <= 16; ++nprocs) {
TiledArray::detail::ProcGrid proc_grid(*GlobalFixture::world, 0, nprocs,
rows, cols, row_size, col_size);
std::cout << "P = " << nprocs << " P_rows = " << proc_grid.proc_rows()
<< " P_cols = " << proc_grid.proc_cols() << "\n";
}
}
#endif
BOOST_AUTO_TEST_SUITE_END()
|