minmax_reduction.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010 Université de Bordeaux 1
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include <assert.h>
  17. #include <float.h>
  18. #include <limits.h>
  19. #include <starpu.h>
  20. static unsigned nblocks = 8192;
  21. static unsigned entries_per_bock = 1024;
  22. #define TYPE double
  23. #define TYPE_MAX DBL_MAX
  24. #define TYPE_MIN DBL_MIN
  25. static TYPE *x;
  26. static starpu_data_handle *x_handles;
  27. /* The first element (resp. second) stores the min element (resp. max). */
  28. static TYPE minmax[2];
  29. static starpu_data_handle minmax_handle;
  30. /*
  31. * Codelet to create a neutral element
  32. */
  33. static void minmax_neutral_cpu_func(void *descr[], void *cl_arg)
  34. {
  35. TYPE *array = (TYPE *)STARPU_VARIABLE_GET_PTR(descr[0]);
  36. /* Initialize current min to the greatest possible value. */
  37. array[0] = TYPE_MAX;
  38. /* Initialize current max to the smallest possible value. */
  39. array[1] = TYPE_MIN;
  40. }
  41. static struct starpu_codelet_t minmax_init_codelet = {
  42. .where = STARPU_CPU,
  43. .cpu_func = minmax_neutral_cpu_func,
  44. .nbuffers = 1
  45. };
  46. /*
  47. * Codelet to perform the reduction of two elements
  48. */
  49. void minmax_redux_cpu_func(void *descr[], void *cl_arg)
  50. {
  51. TYPE *array_dst = (TYPE *)STARPU_VARIABLE_GET_PTR(descr[0]);
  52. TYPE *array_src = (TYPE *)STARPU_VARIABLE_GET_PTR(descr[1]);
  53. /* Compute the min value */
  54. TYPE min_dst = array_dst[0];
  55. TYPE min_src = array_src[0];
  56. array_dst[0] = STARPU_MIN(min_dst, min_src);
  57. /* Compute the max value */
  58. TYPE max_dst = array_dst[1];
  59. TYPE max_src = array_src[1];
  60. array_dst[1] = STARPU_MAX(max_dst, max_src);
  61. }
  62. static struct starpu_codelet_t minmax_redux_codelet = {
  63. .where = STARPU_CPU,
  64. .cpu_func = minmax_redux_cpu_func,
  65. .nbuffers = 2
  66. };
  67. /*
  68. * Compute max/min within a vector and update the min/max value
  69. */
  70. void minmax_cpu_func(void *descr[], void *cl_arg)
  71. {
  72. /* The array containing the values */
  73. TYPE *local_array = (TYPE *)STARPU_VECTOR_GET_PTR(descr[0]);
  74. unsigned n = STARPU_VECTOR_GET_NX(descr[0]);
  75. TYPE *minmax = (TYPE *)STARPU_VARIABLE_GET_PTR(descr[1]);
  76. TYPE local_min = minmax[0];
  77. TYPE local_max = minmax[1];
  78. /* Compute the min and the max elements in the array */
  79. unsigned i;
  80. for (i = 0; i < n; i++)
  81. {
  82. TYPE val = local_array[i];
  83. local_min = STARPU_MIN(local_min, val);
  84. local_max = STARPU_MAX(local_max, val);
  85. }
  86. minmax[0] = local_min;
  87. minmax[1] = local_max;
  88. }
  89. static struct starpu_codelet_t minmax_codelet = {
  90. .where = STARPU_CPU,
  91. .cpu_func = minmax_cpu_func,
  92. .nbuffers = 2
  93. };
  94. /*
  95. * Tasks initialization
  96. */
  97. int main(int argc, char **argv)
  98. {
  99. unsigned long i;
  100. starpu_init(NULL);
  101. unsigned long nelems = nblocks*entries_per_bock;
  102. size_t size = nelems*sizeof(TYPE);
  103. x = malloc(size);
  104. x_handles = calloc(nblocks, sizeof(starpu_data_handle));
  105. assert(x && x_handles);
  106. /* Initialize the vector with random values */
  107. starpu_srand48(0);
  108. for (i = 0; i < nelems; i++)
  109. x[i] = (TYPE)starpu_drand48();
  110. unsigned block;
  111. for (block = 0; block < nblocks; block++)
  112. {
  113. uintptr_t block_start = (uintptr_t)&x[entries_per_bock*block];
  114. starpu_vector_data_register(&x_handles[block], 0, block_start,
  115. entries_per_bock, sizeof(TYPE));
  116. }
  117. /* Initialize current min */
  118. minmax[0] = TYPE_MAX;
  119. /* Initialize current max */
  120. minmax[1] = TYPE_MIN;
  121. starpu_variable_data_register(&minmax_handle, 0, (uintptr_t)minmax, 2*sizeof(TYPE));
  122. /* Set the methods to define neutral elements and to perform the reduction operation */
  123. starpu_data_set_reduction_methods(minmax_handle, &minmax_redux_codelet, &minmax_init_codelet);
  124. for (block = 0; block < nblocks; block++)
  125. {
  126. struct starpu_task *task = starpu_task_create();
  127. task->cl = &minmax_codelet;
  128. task->buffers[0].handle = x_handles[block];
  129. task->buffers[0].mode = STARPU_R;
  130. task->buffers[1].handle = minmax_handle;
  131. task->buffers[1].mode = STARPU_REDUX;
  132. int ret = starpu_task_submit(task);
  133. if (ret)
  134. {
  135. STARPU_ASSERT(ret == -ENODEV);
  136. fprintf(stderr, "This test can only run on CPUs, but there are no CPU workers (this is not a bug).\n");
  137. return 0;
  138. }
  139. }
  140. starpu_data_unregister(minmax_handle);
  141. fprintf(stderr, "Min : %e\n", minmax[0]);
  142. fprintf(stderr, "Max : %e\n", minmax[1]);
  143. STARPU_ASSERT(minmax[0] <= minmax[1]);
  144. starpu_shutdown();
  145. return 0;
  146. }