blob: 4faf3be65f83abe9349860e44a9b5e78716a2366 [file] [log] [blame]
#include <gtest/gtest.h>
#include <pthreadpool.h>
#include <algorithm>
#include <atomic>
#include <cstddef>
#include <memory>
typedef std::unique_ptr<pthreadpool, decltype(&pthreadpool_destroy)> auto_pthreadpool_t;
const size_t kParallelize1DRange = 1223;
const size_t kParallelize1DTile1DRange = 1303;
const size_t kParallelize1DTile1DTile = 11;
const size_t kParallelize2DRangeI = 41;
const size_t kParallelize2DRangeJ = 43;
const size_t kParallelize2DTile1DRangeI = 43;
const size_t kParallelize2DTile1DRangeJ = 53;
const size_t kParallelize2DTile1DTileJ = 5;
const size_t kParallelize2DTile2DRangeI = 53;
const size_t kParallelize2DTile2DRangeJ = 59;
const size_t kParallelize2DTile2DTileI = 5;
const size_t kParallelize2DTile2DTileJ = 7;
const size_t kParallelize3DTile2DRangeI = 19;
const size_t kParallelize3DTile2DRangeJ = 23;
const size_t kParallelize3DTile2DRangeK = 29;
const size_t kParallelize3DTile2DTileJ = 2;
const size_t kParallelize3DTile2DTileK = 3;
const size_t kParallelize4DTile2DRangeI = 17;
const size_t kParallelize4DTile2DRangeJ = 19;
const size_t kParallelize4DTile2DRangeK = 23;
const size_t kParallelize4DTile2DRangeL = 29;
const size_t kParallelize4DTile2DTileK = 2;
const size_t kParallelize4DTile2DTileL = 3;
const size_t kParallelize5DTile2DRangeI = 13;
const size_t kParallelize5DTile2DRangeJ = 17;
const size_t kParallelize5DTile2DRangeK = 19;
const size_t kParallelize5DTile2DRangeL = 23;
const size_t kParallelize5DTile2DRangeM = 29;
const size_t kParallelize5DTile2DTileL = 3;
const size_t kParallelize5DTile2DTileM = 2;
const size_t kParallelize6DTile2DRangeI = 7;
const size_t kParallelize6DTile2DRangeJ = 11;
const size_t kParallelize6DTile2DRangeK = 13;
const size_t kParallelize6DTile2DRangeL = 17;
const size_t kParallelize6DTile2DRangeM = 19;
const size_t kParallelize6DTile2DRangeN = 23;
const size_t kParallelize6DTile2DTileM = 3;
const size_t kParallelize6DTile2DTileN = 2;
const size_t kIncrementIterations = 101;
const size_t kIncrementIterations5D = 7;
const size_t kIncrementIterations6D = 3;
TEST(CreateAndDestroy, NullThreadPool) {
pthreadpool* threadpool = nullptr;
pthreadpool_destroy(threadpool);
}
TEST(CreateAndDestroy, SingleThreadPool) {
pthreadpool* threadpool = pthreadpool_create(1);
ASSERT_TRUE(threadpool);
pthreadpool_destroy(threadpool);
}
TEST(CreateAndDestroy, MultiThreadPool) {
pthreadpool* threadpool = pthreadpool_create(0);
ASSERT_TRUE(threadpool);
pthreadpool_destroy(threadpool);
}
static void ComputeNothing1D(void*, size_t) {
}
TEST(Parallelize1D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d(threadpool.get(),
ComputeNothing1D,
nullptr,
kParallelize1DRange,
0 /* flags */);
}
TEST(Parallelize1D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d(
threadpool.get(),
ComputeNothing1D,
nullptr,
kParallelize1DRange,
0 /* flags */);
}
static void CheckBounds1D(void*, size_t i) {
EXPECT_LT(i, kParallelize1DRange);
}
TEST(Parallelize1D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d(
threadpool.get(),
CheckBounds1D,
nullptr,
kParallelize1DRange,
0 /* flags */);
}
TEST(Parallelize1D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d(
threadpool.get(),
CheckBounds1D,
nullptr,
kParallelize1DRange,
0 /* flags */);
}
static void SetTrue1D(std::atomic_bool* processed_indicators, size_t i) {
processed_indicators[i].store(true, std::memory_order_relaxed);
}
TEST(Parallelize1D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(SetTrue1D),
static_cast<void*>(indicators.data()),
kParallelize1DRange,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DRange; i++) {
EXPECT_TRUE(indicators[i].load(std::memory_order_relaxed))
<< "Element " << i << " not processed";
}
}
TEST(Parallelize1D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(SetTrue1D),
static_cast<void*>(indicators.data()),
kParallelize1DRange,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DRange; i++) {
EXPECT_TRUE(indicators[i].load(std::memory_order_relaxed))
<< "Element " << i << " not processed";
}
}
static void Increment1D(std::atomic_int* processed_counters, size_t i) {
processed_counters[i].fetch_add(1, std::memory_order_relaxed);
}
TEST(Parallelize1D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(Increment1D),
static_cast<void*>(counters.data()),
kParallelize1DRange,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), 1)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
TEST(Parallelize1D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(Increment1D),
static_cast<void*>(counters.data()),
kParallelize1DRange,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), 1)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
TEST(Parallelize1D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(Increment1D),
static_cast<void*>(counters.data()),
kParallelize1DRange,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
TEST(Parallelize1D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(Increment1D),
static_cast<void*>(counters.data()),
kParallelize1DRange,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
static void WorkImbalance1D(std::atomic_int* num_processed_items, size_t i) {
num_processed_items->fetch_add(1, std::memory_order_relaxed);
if (i == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize1DRange) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize1D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_t>(WorkImbalance1D),
static_cast<void*>(&num_processed_items),
kParallelize1DRange,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize1DRange);
}
static void ComputeNothing1DTile1D(void*, size_t, size_t) {
}
TEST(Parallelize1DTile1D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d_tile_1d(threadpool.get(),
ComputeNothing1DTile1D,
nullptr,
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
TEST(Parallelize1DTile1D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
ComputeNothing1DTile1D,
nullptr,
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
static void CheckBounds1DTile1D(void*, size_t start_i, size_t tile_i) {
EXPECT_LT(start_i, kParallelize1DTile1DRange);
EXPECT_LE(start_i + tile_i, kParallelize1DTile1DRange);
}
TEST(Parallelize1DTile1D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
CheckBounds1DTile1D,
nullptr,
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
TEST(Parallelize1DTile1D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
CheckBounds1DTile1D,
nullptr,
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
static void CheckTiling1DTile1D(void*, size_t start_i, size_t tile_i) {
EXPECT_GT(tile_i, 0);
EXPECT_LE(tile_i, kParallelize1DTile1DTile);
EXPECT_EQ(start_i % kParallelize1DTile1DTile, 0);
EXPECT_EQ(tile_i, std::min<size_t>(kParallelize1DTile1DTile, kParallelize1DTile1DRange - start_i));
}
TEST(Parallelize1DTile1D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
CheckTiling1DTile1D,
nullptr,
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
TEST(Parallelize1DTile1D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
CheckTiling1DTile1D,
nullptr,
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
static void SetTrue1DTile1D(std::atomic_bool* processed_indicators, size_t start_i, size_t tile_i) {
for (size_t i = start_i; i < start_i + tile_i; i++) {
processed_indicators[i].store(true, std::memory_order_relaxed);
}
}
TEST(Parallelize1DTile1D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize1DTile1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(SetTrue1DTile1D),
static_cast<void*>(indicators.data()),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DTile1DRange; i++) {
EXPECT_TRUE(indicators[i].load(std::memory_order_relaxed))
<< "Element " << i << " not processed";
}
}
TEST(Parallelize1DTile1D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize1DTile1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(SetTrue1DTile1D),
static_cast<void*>(indicators.data()),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DTile1DRange; i++) {
EXPECT_TRUE(indicators[i].load(std::memory_order_relaxed))
<< "Element " << i << " not processed";
}
}
static void Increment1DTile1D(std::atomic_int* processed_counters, size_t start_i, size_t tile_i) {
for (size_t i = start_i; i < start_i + tile_i; i++) {
processed_counters[i].fetch_add(1, std::memory_order_relaxed);
}
}
TEST(Parallelize1DTile1D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize1DTile1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(Increment1DTile1D),
static_cast<void*>(counters.data()),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DTile1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), 1)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
TEST(Parallelize1DTile1D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize1DTile1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(Increment1DTile1D),
static_cast<void*>(counters.data()),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
for (size_t i = 0; i < kParallelize1DTile1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), 1)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
TEST(Parallelize1DTile1D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize1DTile1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(Increment1DTile1D),
static_cast<void*>(counters.data()),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize1DTile1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
TEST(Parallelize1DTile1D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize1DTile1DRange);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(Increment1DTile1D),
static_cast<void*>(counters.data()),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize1DTile1DRange; i++) {
EXPECT_EQ(counters[i].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element " << i << " was processed " << counters[i].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
static void WorkImbalance1DTile1D(std::atomic_int* num_processed_items, size_t start_i, size_t tile_i) {
num_processed_items->fetch_add(tile_i, std::memory_order_relaxed);
if (start_i == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize1DTile1DRange) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize1DTile1D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_1d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_1d_tile_1d_t>(WorkImbalance1DTile1D),
static_cast<void*>(&num_processed_items),
kParallelize1DTile1DRange, kParallelize1DTile1DTile,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize1DTile1DRange);
}
static void ComputeNothing2D(void*, size_t, size_t) {
}
TEST(Parallelize2D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d(threadpool.get(),
ComputeNothing2D,
nullptr,
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
}
TEST(Parallelize2D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d(
threadpool.get(),
ComputeNothing2D,
nullptr,
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
}
static void CheckBounds2D(void*, size_t i, size_t j) {
EXPECT_LT(i, kParallelize2DRangeI);
EXPECT_LT(j, kParallelize2DRangeJ);
}
TEST(Parallelize2D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d(
threadpool.get(),
CheckBounds2D,
nullptr,
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
}
TEST(Parallelize2D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d(
threadpool.get(),
CheckBounds2D,
nullptr,
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
}
static void SetTrue2D(std::atomic_bool* processed_indicators, size_t i, size_t j) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
TEST(Parallelize2D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize2DRangeI * kParallelize2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(SetTrue2D),
static_cast<void*>(indicators.data()),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ") not processed";
}
}
}
TEST(Parallelize2D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize2DRangeI * kParallelize2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(SetTrue2D),
static_cast<void*>(indicators.data()),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ") not processed";
}
}
}
static void Increment2D(std::atomic_int* processed_counters, size_t i, size_t j) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
TEST(Parallelize2D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize2DRangeI * kParallelize2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(Increment2D),
static_cast<void*>(counters.data()),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
TEST(Parallelize2D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize2DRangeI * kParallelize2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(Increment2D),
static_cast<void*>(counters.data()),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
TEST(Parallelize2D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize2DRangeI * kParallelize2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(Increment2D),
static_cast<void*>(counters.data()),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
TEST(Parallelize2D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize2DRangeI * kParallelize2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(Increment2D),
static_cast<void*>(counters.data()),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
static void WorkImbalance2D(std::atomic_int* num_processed_items, size_t i, size_t j) {
num_processed_items->fetch_add(1, std::memory_order_relaxed);
if (i == 0 && j == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize2DRangeI * kParallelize2DRangeJ) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize2D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_t>(WorkImbalance2D),
static_cast<void*>(&num_processed_items),
kParallelize2DRangeI, kParallelize2DRangeJ,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize2DRangeI * kParallelize2DRangeJ);
}
static void ComputeNothing2DTile1D(void*, size_t, size_t, size_t) {
}
TEST(Parallelize2DTile1D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_1d(threadpool.get(),
ComputeNothing2DTile1D,
nullptr,
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
TEST(Parallelize2DTile1D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
ComputeNothing2DTile1D,
nullptr,
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
static void CheckBounds2DTile1D(void*, size_t i, size_t start_j, size_t tile_j) {
EXPECT_LT(i, kParallelize2DTile1DRangeI);
EXPECT_LT(start_j, kParallelize2DTile1DRangeJ);
EXPECT_LE(start_j + tile_j, kParallelize2DTile1DRangeJ);
}
TEST(Parallelize2DTile1D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
CheckBounds2DTile1D,
nullptr,
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
TEST(Parallelize2DTile1D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
CheckBounds2DTile1D,
nullptr,
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
static void CheckTiling2DTile1D(void*, size_t i, size_t start_j, size_t tile_j) {
EXPECT_GT(tile_j, 0);
EXPECT_LE(tile_j, kParallelize2DTile1DTileJ);
EXPECT_EQ(start_j % kParallelize2DTile1DTileJ, 0);
EXPECT_EQ(tile_j, std::min<size_t>(kParallelize2DTile1DTileJ, kParallelize2DTile1DRangeJ - start_j));
}
TEST(Parallelize2DTile1D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
CheckTiling2DTile1D,
nullptr,
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
TEST(Parallelize2DTile1D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
CheckTiling2DTile1D,
nullptr,
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
static void SetTrue2DTile1D(std::atomic_bool* processed_indicators, size_t i, size_t start_j, size_t tile_j) {
for (size_t j = start_j; j < start_j + tile_j; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
}
TEST(Parallelize2DTile1D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(SetTrue2DTile1D),
static_cast<void*>(indicators.data()),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile1DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile1DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ") not processed";
}
}
}
TEST(Parallelize2DTile1D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(SetTrue2DTile1D),
static_cast<void*>(indicators.data()),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile1DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile1DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ") not processed";
}
}
}
static void Increment2DTile1D(std::atomic_int* processed_counters, size_t i, size_t start_j, size_t tile_j) {
for (size_t j = start_j; j < start_j + tile_j; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
}
TEST(Parallelize2DTile1D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(Increment2DTile1D),
static_cast<void*>(counters.data()),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile1DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile1DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
TEST(Parallelize2DTile1D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(Increment2DTile1D),
static_cast<void*>(counters.data()),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile1DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile1DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
TEST(Parallelize2DTile1D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(Increment2DTile1D),
static_cast<void*>(counters.data()),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize2DTile1DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile1DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
TEST(Parallelize2DTile1D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(Increment2DTile1D),
static_cast<void*>(counters.data()),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize2DTile1DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile1DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile1DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
static void WorkImbalance2DTile1D(std::atomic_int* num_processed_items, size_t i, size_t start_j, size_t tile_j) {
num_processed_items->fetch_add(tile_j, std::memory_order_relaxed);
if (i == 0 && start_j == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize2DTile1D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_1d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_1d_t>(WorkImbalance2DTile1D),
static_cast<void*>(&num_processed_items),
kParallelize2DTile1DRangeI, kParallelize2DTile1DRangeJ, kParallelize2DTile1DTileJ,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize2DTile1DRangeI * kParallelize2DTile1DRangeJ);
}
static void ComputeNothing2DTile2D(void*, size_t, size_t, size_t, size_t) {
}
TEST(Parallelize2DTile2D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_2d(threadpool.get(),
ComputeNothing2DTile2D,
nullptr,
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
TEST(Parallelize2DTile2D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
ComputeNothing2DTile2D,
nullptr,
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
static void CheckBounds2DTile2D(void*, size_t start_i, size_t start_j, size_t tile_i, size_t tile_j) {
EXPECT_LT(start_i, kParallelize2DTile2DRangeI);
EXPECT_LT(start_j, kParallelize2DTile2DRangeJ);
EXPECT_LE(start_i + tile_i, kParallelize2DTile2DRangeI);
EXPECT_LE(start_j + tile_j, kParallelize2DTile2DRangeJ);
}
TEST(Parallelize2DTile2D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
CheckBounds2DTile2D,
nullptr,
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
TEST(Parallelize2DTile2D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
CheckBounds2DTile2D,
nullptr,
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
static void CheckTiling2DTile2D(void*, size_t start_i, size_t start_j, size_t tile_i, size_t tile_j) {
EXPECT_GT(tile_i, 0);
EXPECT_LE(tile_i, kParallelize2DTile2DTileI);
EXPECT_EQ(start_i % kParallelize2DTile2DTileI, 0);
EXPECT_EQ(tile_i, std::min<size_t>(kParallelize2DTile2DTileI, kParallelize2DTile2DRangeI - start_i));
EXPECT_GT(tile_j, 0);
EXPECT_LE(tile_j, kParallelize2DTile2DTileJ);
EXPECT_EQ(start_j % kParallelize2DTile2DTileJ, 0);
EXPECT_EQ(tile_j, std::min<size_t>(kParallelize2DTile2DTileJ, kParallelize2DTile2DRangeJ - start_j));
}
TEST(Parallelize2DTile2D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
CheckTiling2DTile2D,
nullptr,
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
TEST(Parallelize2DTile2D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
CheckTiling2DTile2D,
nullptr,
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
static void SetTrue2DTile2D(std::atomic_bool* processed_indicators, size_t start_i, size_t start_j, size_t tile_i, size_t tile_j) {
for (size_t i = start_i; i < start_i + tile_i; i++) {
for (size_t j = start_j; j < start_j + tile_j; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
}
}
TEST(Parallelize2DTile2D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(SetTrue2DTile2D),
static_cast<void*>(indicators.data()),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ") not processed";
}
}
}
TEST(Parallelize2DTile2D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(SetTrue2DTile2D),
static_cast<void*>(indicators.data()),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ") not processed";
}
}
}
static void Increment2DTile2D(std::atomic_int* processed_counters, size_t start_i, size_t start_j, size_t tile_i, size_t tile_j) {
for (size_t i = start_i; i < start_i + tile_i; i++) {
for (size_t j = start_j; j < start_j + tile_j; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
}
}
TEST(Parallelize2DTile2D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(Increment2DTile2D),
static_cast<void*>(counters.data()),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
TEST(Parallelize2DTile2D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(Increment2DTile2D),
static_cast<void*>(counters.data()),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
for (size_t i = 0; i < kParallelize2DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
TEST(Parallelize2DTile2D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(Increment2DTile2D),
static_cast<void*>(counters.data()),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize2DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
TEST(Parallelize2DTile2D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(Increment2DTile2D),
static_cast<void*>(counters.data()),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize2DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize2DTile2DRangeJ; j++) {
const size_t linear_idx = i * kParallelize2DTile2DRangeJ + j;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
static void WorkImbalance2DTile2D(std::atomic_int* num_processed_items, size_t start_i, size_t start_j, size_t tile_i, size_t tile_j) {
num_processed_items->fetch_add(tile_i * tile_j, std::memory_order_relaxed);
if (start_i == 0 && start_j == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize2DTile2D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_2d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_2d_tile_2d_t>(WorkImbalance2DTile2D),
static_cast<void*>(&num_processed_items),
kParallelize2DTile2DRangeI, kParallelize2DTile2DRangeJ,
kParallelize2DTile2DTileI, kParallelize2DTile2DTileJ,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize2DTile2DRangeI * kParallelize2DTile2DRangeJ);
}
static void ComputeNothing3DTile2D(void*, size_t, size_t, size_t, size_t, size_t) {
}
TEST(Parallelize3DTile2D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_3d_tile_2d(threadpool.get(),
ComputeNothing3DTile2D,
nullptr,
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
TEST(Parallelize3DTile2D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
ComputeNothing3DTile2D,
nullptr,
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
static void CheckBounds3DTile2D(void*, size_t i, size_t start_j, size_t start_k, size_t tile_j, size_t tile_k) {
EXPECT_LT(i, kParallelize3DTile2DRangeI);
EXPECT_LT(start_j, kParallelize3DTile2DRangeJ);
EXPECT_LT(start_k, kParallelize3DTile2DRangeK);
EXPECT_LE(start_j + tile_j, kParallelize3DTile2DRangeJ);
EXPECT_LE(start_k + tile_k, kParallelize3DTile2DRangeK);
}
TEST(Parallelize3DTile2D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
CheckBounds3DTile2D,
nullptr,
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
TEST(Parallelize3DTile2D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
CheckBounds3DTile2D,
nullptr,
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
static void CheckTiling3DTile2D(void*, size_t i, size_t start_j, size_t start_k, size_t tile_j, size_t tile_k) {
EXPECT_GT(tile_j, 0);
EXPECT_LE(tile_j, kParallelize3DTile2DTileJ);
EXPECT_EQ(start_j % kParallelize3DTile2DTileJ, 0);
EXPECT_EQ(tile_j, std::min<size_t>(kParallelize3DTile2DTileJ, kParallelize3DTile2DRangeJ - start_j));
EXPECT_GT(tile_k, 0);
EXPECT_LE(tile_k, kParallelize3DTile2DTileK);
EXPECT_EQ(start_k % kParallelize3DTile2DTileK, 0);
EXPECT_EQ(tile_k, std::min<size_t>(kParallelize3DTile2DTileK, kParallelize3DTile2DRangeK - start_k));
}
TEST(Parallelize3DTile2D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
CheckTiling3DTile2D,
nullptr,
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
TEST(Parallelize3DTile2D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
CheckTiling3DTile2D,
nullptr,
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
static void SetTrue3DTile2D(std::atomic_bool* processed_indicators, size_t i, size_t start_j, size_t start_k, size_t tile_j, size_t tile_k) {
for (size_t j = start_j; j < start_j + tile_j; j++) {
for (size_t k = start_k; k < start_k + tile_k; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
}
}
TEST(Parallelize3DTile2D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(SetTrue3DTile2D),
static_cast<void*>(indicators.data()),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
for (size_t i = 0; i < kParallelize3DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize3DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize3DTile2DRangeK; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ") not processed";
}
}
}
}
TEST(Parallelize3DTile2D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(SetTrue3DTile2D),
static_cast<void*>(indicators.data()),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
for (size_t i = 0; i < kParallelize3DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize3DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize3DTile2DRangeK; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ") not processed";
}
}
}
}
static void Increment3DTile2D(std::atomic_int* processed_counters, size_t i, size_t start_j, size_t start_k, size_t tile_j, size_t tile_k) {
for (size_t j = start_j; j < start_j + tile_j; j++) {
for (size_t k = start_k; k < start_k + tile_k; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
}
}
TEST(Parallelize3DTile2D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(Increment3DTile2D),
static_cast<void*>(counters.data()),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
for (size_t i = 0; i < kParallelize3DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize3DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize3DTile2DRangeK; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
TEST(Parallelize3DTile2D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(Increment3DTile2D),
static_cast<void*>(counters.data()),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
for (size_t i = 0; i < kParallelize3DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize3DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize3DTile2DRangeK; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
TEST(Parallelize3DTile2D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(Increment3DTile2D),
static_cast<void*>(counters.data()),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize3DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize3DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize3DTile2DRangeK; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ", " << k << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
}
TEST(Parallelize3DTile2D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(Increment3DTile2D),
static_cast<void*>(counters.data()),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize3DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize3DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize3DTile2DRangeK; k++) {
const size_t linear_idx = (i * kParallelize3DTile2DRangeJ + j) * kParallelize3DTile2DRangeK + k;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ", " << k << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
}
static void WorkImbalance3DTile2D(std::atomic_int* num_processed_items, size_t i, size_t start_j, size_t start_k, size_t tile_j, size_t tile_k) {
num_processed_items->fetch_add(tile_j * tile_k, std::memory_order_relaxed);
if (i == 0 && start_j == 0 && start_k == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize3DTile2D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_3d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_3d_tile_2d_t>(WorkImbalance3DTile2D),
static_cast<void*>(&num_processed_items),
kParallelize3DTile2DRangeI, kParallelize3DTile2DRangeJ, kParallelize3DTile2DRangeK,
kParallelize3DTile2DTileJ, kParallelize3DTile2DTileK,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize3DTile2DRangeI * kParallelize3DTile2DRangeJ * kParallelize3DTile2DRangeK);
}
static void ComputeNothing4DTile2D(void*, size_t, size_t, size_t, size_t, size_t, size_t) {
}
TEST(Parallelize4DTile2D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_4d_tile_2d(threadpool.get(),
ComputeNothing4DTile2D,
nullptr,
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
TEST(Parallelize4DTile2D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
ComputeNothing4DTile2D,
nullptr,
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
static void CheckBounds4DTile2D(void*, size_t i, size_t j, size_t start_k, size_t start_l, size_t tile_k, size_t tile_l) {
EXPECT_LT(i, kParallelize4DTile2DRangeI);
EXPECT_LT(j, kParallelize4DTile2DRangeJ);
EXPECT_LT(start_k, kParallelize4DTile2DRangeK);
EXPECT_LT(start_l, kParallelize4DTile2DRangeL);
EXPECT_LE(start_k + tile_k, kParallelize4DTile2DRangeK);
EXPECT_LE(start_l + tile_l, kParallelize4DTile2DRangeL);
}
TEST(Parallelize4DTile2D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
CheckBounds4DTile2D,
nullptr,
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
TEST(Parallelize4DTile2D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
CheckBounds4DTile2D,
nullptr,
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
static void CheckTiling4DTile2D(void*, size_t i, size_t j, size_t start_k, size_t start_l, size_t tile_k, size_t tile_l) {
EXPECT_GT(tile_k, 0);
EXPECT_LE(tile_k, kParallelize4DTile2DTileK);
EXPECT_EQ(start_k % kParallelize4DTile2DTileK, 0);
EXPECT_EQ(tile_k, std::min<size_t>(kParallelize4DTile2DTileK, kParallelize4DTile2DRangeK - start_k));
EXPECT_GT(tile_l, 0);
EXPECT_LE(tile_l, kParallelize4DTile2DTileL);
EXPECT_EQ(start_l % kParallelize4DTile2DTileL, 0);
EXPECT_EQ(tile_l, std::min<size_t>(kParallelize4DTile2DTileL, kParallelize4DTile2DRangeL - start_l));
}
TEST(Parallelize4DTile2D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
CheckTiling4DTile2D,
nullptr,
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
TEST(Parallelize4DTile2D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
CheckTiling4DTile2D,
nullptr,
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
static void SetTrue4DTile2D(std::atomic_bool* processed_indicators, size_t i, size_t j, size_t start_k, size_t start_l, size_t tile_k, size_t tile_l) {
for (size_t k = start_k; k < start_k + tile_k; k++) {
for (size_t l = start_l; l < start_l + tile_l; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
}
}
TEST(Parallelize4DTile2D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(SetTrue4DTile2D),
static_cast<void*>(indicators.data()),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
for (size_t i = 0; i < kParallelize4DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize4DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize4DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize4DTile2DRangeL; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ") not processed";
}
}
}
}
}
TEST(Parallelize4DTile2D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(SetTrue4DTile2D),
static_cast<void*>(indicators.data()),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
for (size_t i = 0; i < kParallelize4DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize4DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize4DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize4DTile2DRangeL; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ") not processed";
}
}
}
}
}
static void Increment4DTile2D(std::atomic_int* processed_counters, size_t i, size_t j, size_t start_k, size_t start_l, size_t tile_k, size_t tile_l) {
for (size_t k = start_k; k < start_k + tile_k; k++) {
for (size_t l = start_l; l < start_l + tile_l; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
}
}
TEST(Parallelize4DTile2D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(Increment4DTile2D),
static_cast<void*>(counters.data()),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
for (size_t i = 0; i < kParallelize4DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize4DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize4DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize4DTile2DRangeL; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
}
TEST(Parallelize4DTile2D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(Increment4DTile2D),
static_cast<void*>(counters.data()),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
for (size_t i = 0; i < kParallelize4DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize4DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize4DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize4DTile2DRangeL; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
}
TEST(Parallelize4DTile2D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(Increment4DTile2D),
static_cast<void*>(counters.data()),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize4DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize4DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize4DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize4DTile2DRangeL; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
}
}
TEST(Parallelize4DTile2D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations; iteration++) {
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(Increment4DTile2D),
static_cast<void*>(counters.data()),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize4DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize4DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize4DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize4DTile2DRangeL; l++) {
const size_t linear_idx = ((i * kParallelize4DTile2DRangeJ + j) * kParallelize4DTile2DRangeK + k) * kParallelize4DTile2DRangeL + l;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations << ")";
}
}
}
}
}
static void WorkImbalance4DTile2D(std::atomic_int* num_processed_items, size_t i, size_t j, size_t start_k, size_t start_l, size_t tile_k, size_t tile_l) {
num_processed_items->fetch_add(tile_k * tile_l, std::memory_order_relaxed);
if (i == 0 && j == 0 && start_k == 0 && start_l == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize4DTile2D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_4d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_4d_tile_2d_t>(WorkImbalance4DTile2D),
static_cast<void*>(&num_processed_items),
kParallelize4DTile2DRangeI, kParallelize4DTile2DRangeJ, kParallelize4DTile2DRangeK, kParallelize4DTile2DRangeL,
kParallelize4DTile2DTileK, kParallelize4DTile2DTileL,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize4DTile2DRangeI * kParallelize4DTile2DRangeJ * kParallelize4DTile2DRangeK * kParallelize4DTile2DRangeL);
}
static void ComputeNothing5DTile2D(void*, size_t, size_t, size_t, size_t, size_t, size_t, size_t) {
}
TEST(Parallelize5DTile2D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_5d_tile_2d(threadpool.get(),
ComputeNothing5DTile2D,
nullptr,
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
TEST(Parallelize5DTile2D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
ComputeNothing5DTile2D,
nullptr,
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
static void CheckBounds5DTile2D(void*, size_t i, size_t j, size_t k, size_t start_l, size_t start_m, size_t tile_l, size_t tile_m) {
EXPECT_LT(i, kParallelize5DTile2DRangeI);
EXPECT_LT(j, kParallelize5DTile2DRangeJ);
EXPECT_LT(k, kParallelize5DTile2DRangeK);
EXPECT_LT(start_l, kParallelize5DTile2DRangeL);
EXPECT_LT(start_m, kParallelize5DTile2DRangeM);
EXPECT_LE(start_l + tile_l, kParallelize5DTile2DRangeL);
EXPECT_LE(start_m + tile_m, kParallelize5DTile2DRangeM);
}
TEST(Parallelize5DTile2D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
CheckBounds5DTile2D,
nullptr,
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
TEST(Parallelize5DTile2D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
CheckBounds5DTile2D,
nullptr,
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
static void CheckTiling5DTile2D(void*, size_t i, size_t j, size_t k, size_t start_l, size_t start_m, size_t tile_l, size_t tile_m) {
EXPECT_GT(tile_l, 0);
EXPECT_LE(tile_l, kParallelize5DTile2DTileL);
EXPECT_EQ(start_l % kParallelize5DTile2DTileL, 0);
EXPECT_EQ(tile_l, std::min<size_t>(kParallelize5DTile2DTileL, kParallelize5DTile2DRangeL - start_l));
EXPECT_GT(tile_m, 0);
EXPECT_LE(tile_m, kParallelize5DTile2DTileM);
EXPECT_EQ(start_m % kParallelize5DTile2DTileM, 0);
EXPECT_EQ(tile_m, std::min<size_t>(kParallelize5DTile2DTileM, kParallelize5DTile2DRangeM - start_m));
}
TEST(Parallelize5DTile2D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
CheckTiling5DTile2D,
nullptr,
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
TEST(Parallelize5DTile2D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
CheckTiling5DTile2D,
nullptr,
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
static void SetTrue5DTile2D(std::atomic_bool* processed_indicators, size_t i, size_t j, size_t k, size_t start_l, size_t start_m, size_t tile_l, size_t tile_m) {
for (size_t l = start_l; l < start_l + tile_l; l++) {
for (size_t m = start_m; m < start_m + tile_m; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
}
}
TEST(Parallelize5DTile2D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(SetTrue5DTile2D),
static_cast<void*>(indicators.data()),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
for (size_t i = 0; i < kParallelize5DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize5DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize5DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize5DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize5DTile2DRangeM; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ") not processed";
}
}
}
}
}
}
TEST(Parallelize5DTile2D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(SetTrue5DTile2D),
static_cast<void*>(indicators.data()),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
for (size_t i = 0; i < kParallelize5DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize5DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize5DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize5DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize5DTile2DRangeM; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ") not processed";
}
}
}
}
}
}
static void Increment5DTile2D(std::atomic_int* processed_counters, size_t i, size_t j, size_t k, size_t start_l, size_t start_m, size_t tile_l, size_t tile_m) {
for (size_t l = start_l; l < start_l + tile_l; l++) {
for (size_t m = start_m; m < start_m + tile_m; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
}
}
TEST(Parallelize5DTile2D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(Increment5DTile2D),
static_cast<void*>(counters.data()),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
for (size_t i = 0; i < kParallelize5DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize5DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize5DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize5DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize5DTile2DRangeM; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
}
}
TEST(Parallelize5DTile2D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(Increment5DTile2D),
static_cast<void*>(counters.data()),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
for (size_t i = 0; i < kParallelize5DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize5DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize5DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize5DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize5DTile2DRangeM; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
}
}
TEST(Parallelize5DTile2D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations5D; iteration++) {
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(Increment5DTile2D),
static_cast<void*>(counters.data()),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize5DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize5DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize5DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize5DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize5DTile2DRangeM; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations5D)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations5D << ")";
}
}
}
}
}
}
TEST(Parallelize5DTile2D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations5D; iteration++) {
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(Increment5DTile2D),
static_cast<void*>(counters.data()),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize5DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize5DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize5DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize5DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize5DTile2DRangeM; m++) {
const size_t linear_idx = (((i * kParallelize5DTile2DRangeJ + j) * kParallelize5DTile2DRangeK + k) * kParallelize5DTile2DRangeL + l) * kParallelize5DTile2DRangeM + m;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations5D)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations5D << ")";
}
}
}
}
}
}
static void WorkImbalance5DTile2D(std::atomic_int* num_processed_items, size_t i, size_t j, size_t k, size_t start_l, size_t start_m, size_t tile_l, size_t tile_m) {
num_processed_items->fetch_add(tile_l * tile_m, std::memory_order_relaxed);
if (i == 0 && j == 0 && k == 0 && start_l == 0 && start_m == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize5DTile2D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_5d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_5d_tile_2d_t>(WorkImbalance5DTile2D),
static_cast<void*>(&num_processed_items),
kParallelize5DTile2DRangeI, kParallelize5DTile2DRangeJ, kParallelize5DTile2DRangeK, kParallelize5DTile2DRangeL, kParallelize5DTile2DRangeM,
kParallelize5DTile2DTileL, kParallelize5DTile2DTileM,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize5DTile2DRangeI * kParallelize5DTile2DRangeJ * kParallelize5DTile2DRangeK * kParallelize5DTile2DRangeL * kParallelize5DTile2DRangeM);
}
static void ComputeNothing6DTile2D(void*, size_t, size_t, size_t, size_t, size_t, size_t, size_t, size_t) {
}
TEST(Parallelize6DTile2D, SingleThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_6d_tile_2d(threadpool.get(),
ComputeNothing6DTile2D,
nullptr,
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
TEST(Parallelize6DTile2D, MultiThreadPoolCompletes) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
ComputeNothing6DTile2D,
nullptr,
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
static void CheckBounds6DTile2D(void*, size_t i, size_t j, size_t k, size_t l, size_t start_m, size_t start_n, size_t tile_m, size_t tile_n) {
EXPECT_LT(i, kParallelize6DTile2DRangeI);
EXPECT_LT(j, kParallelize6DTile2DRangeJ);
EXPECT_LT(k, kParallelize6DTile2DRangeK);
EXPECT_LT(l, kParallelize6DTile2DRangeL);
EXPECT_LT(start_m, kParallelize6DTile2DRangeM);
EXPECT_LT(start_n, kParallelize6DTile2DRangeN);
EXPECT_LE(start_m + tile_m, kParallelize6DTile2DRangeM);
EXPECT_LE(start_n + tile_n, kParallelize6DTile2DRangeN);
}
TEST(Parallelize6DTile2D, SingleThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
CheckBounds6DTile2D,
nullptr,
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
TEST(Parallelize6DTile2D, MultiThreadPoolAllItemsInBounds) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
CheckBounds6DTile2D,
nullptr,
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
static void CheckTiling6DTile2D(void*, size_t i, size_t j, size_t k, size_t l, size_t start_m, size_t start_n, size_t tile_m, size_t tile_n) {
EXPECT_GT(tile_m, 0);
EXPECT_LE(tile_m, kParallelize6DTile2DTileM);
EXPECT_EQ(start_m % kParallelize6DTile2DTileM, 0);
EXPECT_EQ(tile_m, std::min<size_t>(kParallelize6DTile2DTileM, kParallelize6DTile2DRangeM - start_m));
EXPECT_GT(tile_n, 0);
EXPECT_LE(tile_n, kParallelize6DTile2DTileN);
EXPECT_EQ(start_n % kParallelize6DTile2DTileN, 0);
EXPECT_EQ(tile_n, std::min<size_t>(kParallelize6DTile2DTileN, kParallelize6DTile2DRangeN - start_n));
}
TEST(Parallelize6DTile2D, SingleThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
CheckTiling6DTile2D,
nullptr,
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
TEST(Parallelize6DTile2D, MultiThreadPoolUniformTiling) {
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
CheckTiling6DTile2D,
nullptr,
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
static void SetTrue6DTile2D(std::atomic_bool* processed_indicators, size_t i, size_t j, size_t k, size_t l, size_t start_m, size_t start_n, size_t tile_m, size_t tile_n) {
for (size_t m = start_m; m < start_m + tile_m; m++) {
for (size_t n = start_n; n < start_n + tile_n; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
processed_indicators[linear_idx].store(true, std::memory_order_relaxed);
}
}
}
TEST(Parallelize6DTile2D, SingleThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(SetTrue6DTile2D),
static_cast<void*>(indicators.data()),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
for (size_t i = 0; i < kParallelize6DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize6DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize6DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize6DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize6DTile2DRangeM; m++) {
for (size_t n = 0; n < kParallelize6DTile2DRangeN; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ", " << n << ") not processed";
}
}
}
}
}
}
}
TEST(Parallelize6DTile2D, MultiThreadPoolAllItemsProcessed) {
std::vector<std::atomic_bool> indicators(kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(SetTrue6DTile2D),
static_cast<void*>(indicators.data()),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
for (size_t i = 0; i < kParallelize6DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize6DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize6DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize6DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize6DTile2DRangeM; m++) {
for (size_t n = 0; n < kParallelize6DTile2DRangeN; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
EXPECT_TRUE(indicators[linear_idx].load(std::memory_order_relaxed))
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ", " << n << ") not processed";
}
}
}
}
}
}
}
static void Increment6DTile2D(std::atomic_int* processed_counters, size_t i, size_t j, size_t k, size_t l, size_t start_m, size_t start_n, size_t tile_m, size_t tile_n) {
for (size_t m = start_m; m < start_m + tile_m; m++) {
for (size_t n = start_n; n < start_n + tile_n; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
processed_counters[linear_idx].fetch_add(1, std::memory_order_relaxed);
}
}
}
TEST(Parallelize6DTile2D, SingleThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(Increment6DTile2D),
static_cast<void*>(counters.data()),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
for (size_t i = 0; i < kParallelize6DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize6DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize6DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize6DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize6DTile2DRangeM; m++) {
for (size_t n = 0; n < kParallelize6DTile2DRangeN; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ", " << n << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
}
}
}
TEST(Parallelize6DTile2D, MultiThreadPoolEachItemProcessedOnce) {
std::vector<std::atomic_int> counters(kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(Increment6DTile2D),
static_cast<void*>(counters.data()),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
for (size_t i = 0; i < kParallelize6DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize6DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize6DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize6DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize6DTile2DRangeM; m++) {
for (size_t n = 0; n < kParallelize6DTile2DRangeN; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), 1)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ", " << n << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times (expected: 1)";
}
}
}
}
}
}
}
TEST(Parallelize6DTile2D, SingleThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
auto_pthreadpool_t threadpool(pthreadpool_create(1), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
for (size_t iteration = 0; iteration < kIncrementIterations6D; iteration++) {
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(Increment6DTile2D),
static_cast<void*>(counters.data()),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize6DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize6DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize6DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize6DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize6DTile2DRangeM; m++) {
for (size_t n = 0; n < kParallelize6DTile2DRangeN; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations6D)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ", " << n << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations6D << ")";
}
}
}
}
}
}
}
TEST(Parallelize6DTile2D, MultiThreadPoolEachItemProcessedMultipleTimes) {
std::vector<std::atomic_int> counters(kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
for (size_t iteration = 0; iteration < kIncrementIterations6D; iteration++) {
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(Increment6DTile2D),
static_cast<void*>(counters.data()),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
}
for (size_t i = 0; i < kParallelize6DTile2DRangeI; i++) {
for (size_t j = 0; j < kParallelize6DTile2DRangeJ; j++) {
for (size_t k = 0; k < kParallelize6DTile2DRangeK; k++) {
for (size_t l = 0; l < kParallelize6DTile2DRangeL; l++) {
for (size_t m = 0; m < kParallelize6DTile2DRangeM; m++) {
for (size_t n = 0; n < kParallelize6DTile2DRangeN; n++) {
const size_t linear_idx = ((((i * kParallelize6DTile2DRangeJ + j) * kParallelize6DTile2DRangeK + k) * kParallelize6DTile2DRangeL + l) * kParallelize6DTile2DRangeM + m) * kParallelize6DTile2DRangeN + n;
EXPECT_EQ(counters[linear_idx].load(std::memory_order_relaxed), kIncrementIterations6D)
<< "Element (" << i << ", " << j << ", " << k << ", " << l << ", " << m << ", " << n << ") was processed "
<< counters[linear_idx].load(std::memory_order_relaxed) << " times "
<< "(expected: " << kIncrementIterations6D << ")";
}
}
}
}
}
}
}
static void WorkImbalance6DTile2D(std::atomic_int* num_processed_items, size_t i, size_t j, size_t k, size_t l, size_t start_m, size_t start_n, size_t tile_m, size_t tile_n) {
num_processed_items->fetch_add(tile_m * tile_n, std::memory_order_relaxed);
if (i == 0 && j == 0 && k == 0 && l == 0 && start_m == 0 && start_n == 0) {
/* Spin-wait until all items are computed */
while (num_processed_items->load(std::memory_order_relaxed) != kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN) {
std::atomic_thread_fence(std::memory_order_acquire);
}
}
}
TEST(Parallelize6DTile2D, MultiThreadPoolWorkStealing) {
std::atomic_int num_processed_items = ATOMIC_VAR_INIT(0);
auto_pthreadpool_t threadpool(pthreadpool_create(0), pthreadpool_destroy);
ASSERT_TRUE(threadpool.get());
if (pthreadpool_get_threads_count(threadpool.get()) <= 1) {
GTEST_SKIP();
}
pthreadpool_parallelize_6d_tile_2d(
threadpool.get(),
reinterpret_cast<pthreadpool_task_6d_tile_2d_t>(WorkImbalance6DTile2D),
static_cast<void*>(&num_processed_items),
kParallelize6DTile2DRangeI, kParallelize6DTile2DRangeJ, kParallelize6DTile2DRangeK, kParallelize6DTile2DRangeL, kParallelize6DTile2DRangeM, kParallelize6DTile2DRangeN,
kParallelize6DTile2DTileM, kParallelize6DTile2DTileN,
0 /* flags */);
EXPECT_EQ(num_processed_items.load(std::memory_order_relaxed), kParallelize6DTile2DRangeI * kParallelize6DTile2DRangeJ * kParallelize6DTile2DRangeK * kParallelize6DTile2DRangeL * kParallelize6DTile2DRangeM * kParallelize6DTile2DRangeN);
}