commit | 83fe7fccc91eff5ef950ac01b864f038720053c1 | [log] [tgz] |
---|---|---|
author | Scott Lobdell <slobdell@google.com> | Tue Feb 23 11:55:06 2021 -0800 |
committer | Scott Lobdell <slobdell@google.com> | Tue Feb 23 11:55:06 2021 -0800 |
tree | 0a031ffb45338947eace1b5a83c67c16c196f968 | |
parent | 44366e3f95f10649273f45bd387b08069fca5337 [diff] | |
parent | b272827557c019bdb51c1d235881c248b2bbce04 [diff] |
Merge SP1A.210222.001 Change-Id: I8ab189a3c55c5fe87d03397b36dc3ae93bf26332
pthreadpool is a portable and efficient thread pool implementation. It provides similar functionality to #pragma omp parallel for
, but with additional features.
The following example demonstates using the thread pool for parallel addition of two arrays:
static void add_arrays(struct array_addition_context* context, size_t i) { context->sum[i] = context->augend[i] + context->addend[i]; } #define ARRAY_SIZE 4 int main() { double augend[ARRAY_SIZE] = { 1.0, 2.0, 4.0, -5.0 }; double addend[ARRAY_SIZE] = { 0.25, -1.75, 0.0, 0.5 }; double sum[ARRAY_SIZE]; pthreadpool_t threadpool = pthreadpool_create(0); assert(threadpool != NULL); const size_t threads_count = pthreadpool_get_threads_count(threadpool); printf("Created thread pool with %zu threads\n", threads_count); struct array_addition_context context = { augend, addend, sum }; pthreadpool_parallelize_1d(threadpool, (pthreadpool_task_1d_t) add_arrays, (void*) &context, ARRAY_SIZE, PTHREADPOOL_FLAG_DISABLE_DENORMALS /* flags */); pthreadpool_destroy(threadpool); threadpool = NULL; printf("%8s\t%.2lf\t%.2lf\t%.2lf\t%.2lf\n", "Augend", augend[0], augend[1], augend[2], augend[3]); printf("%8s\t%.2lf\t%.2lf\t%.2lf\t%.2lf\n", "Addend", addend[0], addend[1], addend[2], addend[3]); printf("%8s\t%.2lf\t%.2lf\t%.2lf\t%.2lf\n", "Sum", sum[0], sum[1], sum[2], sum[3]); return 0; }