You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
ut_SG560D/QSSI.12/external/pthreadpool
quectel 55794fdde8 QCM6490:Alyssa:upload QCM6490 android12 base code.
Change-Id: If3e3c4e01b19443714d880ae669aaa8b39edfff7
4 years ago
..
bench QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
cmake QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
examples QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
include QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
src QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
test QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
.travis.yml QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
Android.bp QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
BUILD.bazel QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
CMakeLists.txt QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
LICENSE QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
METADATA QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
MODULE_LICENSE_BSD QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
OWNERS QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
README.md QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
TEST_MAPPING QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
WORKSPACE QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
configure.py QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago
confu.yaml QCM6490:Alyssa:upload QCM6490 android12 base code. 4 years ago

README.md

pthreadpool

BSD (2 clause) License Build Status

pthreadpool is a portable and efficient thread pool implementation. It provides similar functionality to #pragma omp parallel for, but with additional features.

Features:

  • C interface (C++-compatible).
  • 1D-6D loops with step parameters.
  • Run on user-specified or auto-detected number of threads.
  • Work-stealing scheduling for efficient work balancing.
  • Wait-free synchronization of work items.
  • Compatible with Linux (including Android), macOS, iOS, Windows, Emscripten environments.
  • 100% unit tests coverage.
  • Throughput and latency microbenchmarks.

Example

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;
}