HW2: Added some test and fix bubblesort <number of iteration> bug
This commit is contained in:
@@ -328,67 +328,3 @@ TEST(TdistBitonic_UT, keepsmall_test7) {
|
||||
EXPECT_EQ(ts_expected[node], keepSmall<SortMode::Bitonic>(node, ts_partner[node], ts_depth));
|
||||
}
|
||||
}
|
||||
|
||||
#if 0
|
||||
TEST(TdistBitonic_UT, distBitonic_test1) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (8), ShadowedVec_t (8)
|
||||
};
|
||||
(unsigned(std::time(nullptr)));
|
||||
for (auto
|
||||
std::srand& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBitonic(2, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
TEST(TdistBitonic_UT, distBitonic_test2) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (8), ShadowedVec_t (8), ShadowedVec_t (8), ShadowedVec_t (8)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBitonic(4, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
TEST(TdistBitonic_UT, distBitonic_test3) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32),
|
||||
ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBitonic(8, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -142,69 +142,3 @@ TEST(TdistBubbletonic_UT, isActive_test2) {
|
||||
EXPECT_EQ(isActive(8, 8), false);
|
||||
EXPECT_EQ(isActive(9, 8), false);
|
||||
}
|
||||
|
||||
|
||||
|
||||
#if 0
|
||||
TEST(TdistBubbletonic_UT, distBubbletonic_test1) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (8), ShadowedVec_t (8)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBubbletonic(2, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
TEST(TdistBubbletonic_UT, distBubbletonic_test2) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (8), ShadowedVec_t (8), ShadowedVec_t (8), ShadowedVec_t (8)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBubbletonic(4, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
TEST(TdistBubbletonic_UT, distBubbletonic_test3) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32),
|
||||
ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBubbletonic(8, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
#endif
|
||||
@@ -91,66 +91,3 @@ TEST(TdistCommonUT, elbowSort_test3) {
|
||||
EXPECT_EQ((ts_data == ts_expected_des), true);
|
||||
}
|
||||
|
||||
#if 0
|
||||
TEST(TdistBubbletonic_UT, distBubbletonic_test1) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (8), ShadowedVec_t (8)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBubbletonic(2, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
TEST(TdistBubbletonic_UT, distBubbletonic_test2) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (8), ShadowedVec_t (8), ShadowedVec_t (8), ShadowedVec_t (8)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBubbletonic(4, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
|
||||
TEST(TdistBubbletonic_UT, distBubbletonic_test3) {
|
||||
AllData_t ts_Data {
|
||||
ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32),
|
||||
ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32), ShadowedVec_t (32)
|
||||
};
|
||||
|
||||
std::srand(unsigned(std::time(nullptr)));
|
||||
for (auto& v : ts_Data) {
|
||||
std::generate(v.begin(), v.end(), std::rand);
|
||||
}
|
||||
|
||||
distBubbletonic(8, ts_Data);
|
||||
|
||||
auto max = std::numeric_limits<ShadowedVec_t::value_type>::min();
|
||||
for (auto& v : ts_Data) {
|
||||
EXPECT_EQ((max <= v[0]), true);
|
||||
EXPECT_EQ(std::is_sorted(v.begin(), v.end()), true);
|
||||
max = v.back();
|
||||
}
|
||||
}
|
||||
#endif
|
||||
@@ -0,0 +1,205 @@
|
||||
/**
|
||||
* \file
|
||||
* \brief PDS HW2 tests
|
||||
*
|
||||
* \author
|
||||
* Christos Choutouridis AEM:8997
|
||||
* <cchoutou@ece.auth.gr>
|
||||
*/
|
||||
|
||||
#include <gtest/gtest.h>
|
||||
#include <mpi.h>
|
||||
#include <random>
|
||||
#include "distsort.hpp"
|
||||
|
||||
MPI_t<> ts_mpi;
|
||||
|
||||
// Mersenne seeded from hw if possible. range: [type_min, type_max]
|
||||
std::random_device rd;
|
||||
std::mt19937 gen(rd());
|
||||
|
||||
class TMPIdistSort : public ::testing::Test {
|
||||
protected:
|
||||
static void SetUpTestSuite() {
|
||||
int argc = 0;
|
||||
char** argv = nullptr;
|
||||
MPI_Init(&argc, &argv);
|
||||
|
||||
int rank, size;
|
||||
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
|
||||
MPI_Comm_size(MPI_COMM_WORLD, &size);
|
||||
ts_mpi.rank_ = rank;
|
||||
ts_mpi.size_ = size;
|
||||
}
|
||||
|
||||
static void TearDownTestSuite() {
|
||||
MPI_Finalize();
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
* To run thiese test execute:
|
||||
* mpirun -np <N> ./bit/tests
|
||||
*/
|
||||
TEST_F(TMPIdistSort, distBubbletonic_test1) {
|
||||
// Create and fill vector
|
||||
using tsValue_t = uint8_t; // Test parameters
|
||||
size_t ts_buffer_size = 16;
|
||||
|
||||
ShadowedVec_t<tsValue_t> ts_Data;
|
||||
std::uniform_int_distribution<tsValue_t > dis(
|
||||
std::numeric_limits<tsValue_t>::min(),
|
||||
std::numeric_limits<tsValue_t>::max()
|
||||
);
|
||||
ts_Data.resize(ts_buffer_size);
|
||||
std::generate(ts_Data.begin(), ts_Data.end(), [&]() { return dis(gen); });
|
||||
|
||||
// Execute function under test in all processes
|
||||
distBubbletonic(ts_Data, ts_mpi.size(), ts_mpi.rank());
|
||||
|
||||
// Local min and max
|
||||
auto local_min = *std::min_element(ts_Data.begin(), ts_Data.end());
|
||||
auto local_max = *std::max_element(ts_Data.begin(), ts_Data.end());
|
||||
|
||||
// Gather min/max to rank 0
|
||||
std::vector<tsValue_t> global_mins(ts_mpi.size());
|
||||
std::vector<tsValue_t> global_maxes(ts_mpi.size());
|
||||
MPI_Datatype datatype = MPI_TypeMapper<tsValue_t>::getType();
|
||||
|
||||
MPI_Gather(&local_min, 1, datatype, global_mins.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
MPI_Gather(&local_max, 1, datatype, global_maxes.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
|
||||
// Check results
|
||||
EXPECT_EQ(std::is_sorted(ts_Data.begin(), ts_Data.end()), true);
|
||||
if (ts_mpi.rank() == 0) {
|
||||
for (size_t i = 1; i < global_mins.size(); ++i) {
|
||||
EXPECT_LE(global_maxes[i - 1], global_mins[i]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* To run thiese test execute:
|
||||
* mpirun -np <N> ./bit/tests
|
||||
*/
|
||||
TEST_F(TMPIdistSort, distBubbletonic_test2) {
|
||||
// Create and fill vector
|
||||
using tsValue_t = uint32_t; // Test parameters
|
||||
size_t ts_buffer_size = 1 << 16;
|
||||
|
||||
ShadowedVec_t<tsValue_t> ts_Data;
|
||||
std::uniform_int_distribution<tsValue_t > dis(
|
||||
std::numeric_limits<tsValue_t>::min(),
|
||||
std::numeric_limits<tsValue_t>::max()
|
||||
);
|
||||
ts_Data.resize(ts_buffer_size);
|
||||
std::generate(ts_Data.begin(), ts_Data.end(), [&]() { return dis(gen); });
|
||||
|
||||
// Execute function under test in all processes
|
||||
distBubbletonic(ts_Data, ts_mpi.size(), ts_mpi.rank());
|
||||
|
||||
// Local min and max
|
||||
auto local_min = *std::min_element(ts_Data.begin(), ts_Data.end());
|
||||
auto local_max = *std::max_element(ts_Data.begin(), ts_Data.end());
|
||||
|
||||
// Gather min/max to rank 0
|
||||
std::vector<tsValue_t> global_mins(ts_mpi.size());
|
||||
std::vector<tsValue_t> global_maxes(ts_mpi.size());
|
||||
MPI_Datatype datatype = MPI_TypeMapper<tsValue_t>::getType();
|
||||
|
||||
MPI_Gather(&local_min, 1, datatype, global_mins.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
MPI_Gather(&local_max, 1, datatype, global_maxes.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
|
||||
// Check results
|
||||
EXPECT_EQ(std::is_sorted(ts_Data.begin(), ts_Data.end()), true);
|
||||
if (ts_mpi.rank() == 0) {
|
||||
for (size_t i = 1; i < global_mins.size(); ++i) {
|
||||
EXPECT_LE(global_maxes[i - 1], global_mins[i]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
* To run thiese test execute:
|
||||
* mpirun -np <N> ./bit/tests
|
||||
*/
|
||||
TEST_F(TMPIdistSort, distBitonic_test1) {
|
||||
// Create and fill vector
|
||||
using tsValue_t = uint8_t; // Test parameters
|
||||
size_t ts_buffer_size = 16;
|
||||
|
||||
ShadowedVec_t<tsValue_t> ts_Data;
|
||||
std::uniform_int_distribution<tsValue_t > dis(
|
||||
std::numeric_limits<tsValue_t>::min(),
|
||||
std::numeric_limits<tsValue_t>::max()
|
||||
);
|
||||
ts_Data.resize(ts_buffer_size);
|
||||
std::generate(ts_Data.begin(), ts_Data.end(), [&]() { return dis(gen); });
|
||||
|
||||
// Execute function under test in all processes
|
||||
distBitonic(ts_Data, ts_mpi.size(), ts_mpi.rank());
|
||||
|
||||
// Local min and max
|
||||
auto local_min = *std::min_element(ts_Data.begin(), ts_Data.end());
|
||||
auto local_max = *std::max_element(ts_Data.begin(), ts_Data.end());
|
||||
|
||||
// Gather min/max to rank 0
|
||||
std::vector<tsValue_t> global_mins(ts_mpi.size());
|
||||
std::vector<tsValue_t> global_maxes(ts_mpi.size());
|
||||
MPI_Datatype datatype = MPI_TypeMapper<tsValue_t>::getType();
|
||||
|
||||
MPI_Gather(&local_min, 1, datatype, global_mins.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
MPI_Gather(&local_max, 1, datatype, global_maxes.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
|
||||
// Check results
|
||||
EXPECT_EQ(std::is_sorted(ts_Data.begin(), ts_Data.end()), true);
|
||||
if (ts_mpi.rank() == 0) {
|
||||
for (size_t i = 1; i < global_mins.size(); ++i) {
|
||||
EXPECT_LE(global_maxes[i - 1], global_mins[i]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* To run thiese test execute:
|
||||
* mpirun -np <N> ./bit/tests
|
||||
*/
|
||||
TEST_F(TMPIdistSort, distBitonic_test2) {
|
||||
// Create and fill vector
|
||||
using tsValue_t = uint32_t; // Test parameters
|
||||
size_t ts_buffer_size = 1 << 16;
|
||||
|
||||
ShadowedVec_t<tsValue_t> ts_Data;
|
||||
std::uniform_int_distribution<tsValue_t > dis(
|
||||
std::numeric_limits<tsValue_t>::min(),
|
||||
std::numeric_limits<tsValue_t>::max()
|
||||
);
|
||||
ts_Data.resize(ts_buffer_size);
|
||||
std::generate(ts_Data.begin(), ts_Data.end(), [&]() { return dis(gen); });
|
||||
|
||||
// Execute function under test in all processes
|
||||
distBitonic(ts_Data, ts_mpi.size(), ts_mpi.rank());
|
||||
|
||||
// Local min and max
|
||||
auto local_min = *std::min_element(ts_Data.begin(), ts_Data.end());
|
||||
auto local_max = *std::max_element(ts_Data.begin(), ts_Data.end());
|
||||
|
||||
// Gather min/max to rank 0
|
||||
std::vector<tsValue_t> global_mins(ts_mpi.size());
|
||||
std::vector<tsValue_t> global_maxes(ts_mpi.size());
|
||||
MPI_Datatype datatype = MPI_TypeMapper<tsValue_t>::getType();
|
||||
|
||||
MPI_Gather(&local_min, 1, datatype, global_mins.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
MPI_Gather(&local_max, 1, datatype, global_maxes.data(), 1, datatype, 0, MPI_COMM_WORLD);
|
||||
|
||||
// Check results
|
||||
EXPECT_EQ(std::is_sorted(ts_Data.begin(), ts_Data.end()), true);
|
||||
if (ts_mpi.rank() == 0) {
|
||||
for (size_t i = 1; i < global_mins.size(); ++i) {
|
||||
EXPECT_LE(global_maxes[i - 1], global_mins[i]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user