vector-scal.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. /*
  2. * StarPU
  3. * Copyright (C) INRIA 2008-2009 (see AUTHORS file)
  4. *
  5. * This program 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. * This program 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. /*
  17. * This example demonstrates how to use StarPU to scale an array by a factor.
  18. * It shows how to manipulate data with StarPU's data management library.
  19. * 1- how to declare a piece of data to StarPU (starpu_register_vector_data)
  20. * 2- how to describe which data are accessed by a task (task->buffers[0])
  21. * 3- how a kernel can manipulate the data (buffers[0].vector.ptr)
  22. */
  23. #include <stdio.h>
  24. #include <stdint.h>
  25. #include <starpu.h>
  26. #define N 2048
  27. /* This kernel takes a buffer and scales it by a constant factor */
  28. static void scal_func(void *buffers[], void *arg)
  29. {
  30. unsigned i;
  31. float *factor = arg;
  32. #warning TODO update
  33. /*
  34. * The "buffers" array matches the task->buffers one: for instance
  35. * task->buffers[0].handle is a handle that corresponds to a data with
  36. * vector "interface". The starpu_data_interface_t is a union type with
  37. * a field for each defined interface. Here, we manipulate the
  38. * buffers[0].vector field: vector.nx gives the number of elements in
  39. * the array, vector.ptr gives the location of the array (that was
  40. * possibly migrated/replicated), and vector.elemsize gives the size of
  41. * each elements.
  42. */
  43. starpu_vector_interface_t *vector = buffers[0];
  44. /* length of the vector */
  45. unsigned n = vector->nx;
  46. /* get a pointer to the local copy of the vector : note that we have to
  47. * cast it in (float *) since a vector could contain any type of
  48. * elements so that the .ptr field is actually a uintptr_t */
  49. float *val = (float *)vector->ptr;
  50. /* scale the vector */
  51. for (i = 0; i < n; i++)
  52. val[i] *= *factor;
  53. }
  54. int main(int argc, char **argv)
  55. {
  56. /* We consider a vector of float that is initialized just as any of C
  57. * data */
  58. float tab[N];
  59. unsigned i;
  60. for (i = 0; i < N; i++)
  61. tab[i] = 1.0f;
  62. fprintf(stderr, "BEFORE : First element was %f\n", tab[0]);
  63. /* Initialize StarPU with default configuration */
  64. starpu_init(NULL);
  65. /* Tell StaPU to associate the "tab" vector with the "tab_handle"
  66. * identifier. When a task needs to access a piece of data, it should
  67. * refer to the handle that is associated to it.
  68. * In the case of the "vector" data interface:
  69. * - the first argument of the registration method is a pointer to the
  70. * handle that should describe the data
  71. * - the second argument is the memory node where the data (ie. "tab")
  72. * resides initially: 0 stands for an address in main memory, as
  73. * opposed to an adress on a GPU for instance.
  74. * - the third argument is the adress of the vector in RAM
  75. * - the fourth argument is the number of elements in the vector
  76. * - the fifth argument is the size of each element.
  77. */
  78. starpu_data_handle tab_handle;
  79. starpu_register_vector_data(&tab_handle, 0, (uintptr_t)tab, N, sizeof(float));
  80. float factor = 3.14;
  81. /* create a synchronous task: any call to starpu_submit_task will block
  82. * until it is terminated */
  83. struct starpu_task *task = starpu_task_create();
  84. task->synchronous = 1;
  85. starpu_codelet cl = {
  86. .where = STARPU_CPU,
  87. /* CPU implementation of the codelet */
  88. .cpu_func = scal_func,
  89. .nbuffers = 1
  90. };
  91. task->cl = &cl;
  92. /* the codelet manipulates one buffer in RW mode */
  93. task->buffers[0].handle = tab_handle;
  94. task->buffers[0].mode = STARPU_RW;
  95. /* an argument is passed to the codelet, beware that this is a
  96. * READ-ONLY buffer and that the codelet may be given a pointer to a
  97. * COPY of the argument */
  98. task->cl_arg = &factor;
  99. task->cl_arg_size = sizeof(float);
  100. /* execute the task on any eligible computational ressource */
  101. starpu_submit_task(task);
  102. /* StarPU does not need to manipulate the array anymore so we can stop
  103. * monitoring it */
  104. starpu_delete_data(tab_handle);
  105. /* terminate StarPU, no task can be submitted after */
  106. starpu_shutdown();
  107. fprintf(stderr, "AFTER First element is %f\n", tab[0]);
  108. return 0;
  109. }