combined_workers.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2012 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011 Centre National de la Recherche Scientifique
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <stdlib.h> // for qsort
  18. #include <starpu.h>
  19. #include <common/config.h>
  20. #include <core/workers.h>
  21. #ifdef __GLIBC__
  22. #include <sched.h>
  23. #endif
  24. #ifdef __MINGW32__
  25. #include <windows.h>
  26. #endif
  27. static int compar_int(const void *pa, const void *pb)
  28. {
  29. int a = *((int *)pa);
  30. int b = *((int *)pb);
  31. return a > b;
  32. }
  33. static void sort_workerid_array(int nworkers, int workerid_array[])
  34. {
  35. qsort(workerid_array, nworkers, sizeof(int), compar_int);
  36. }
  37. /* Create a new worker id for a combination of workers. This method should
  38. * typically be called at the initialization of the scheduling policy. This
  39. * worker should be the combination of the list of id's contained in the
  40. * workerid_array array which has nworkers entries. This function returns
  41. * the identifier of the combined worker in case of success, a negative value
  42. * is returned otherwise. */
  43. int starpu_combined_worker_assign_workerid(int nworkers, int workerid_array[])
  44. {
  45. int new_workerid;
  46. /* Return the number of actual workers. */
  47. struct _starpu_machine_config *config = _starpu_get_machine_config();
  48. int basic_worker_count = (int)config->topology.nworkers;
  49. int combined_worker_id = (int)config->topology.ncombinedworkers;
  50. /* We sort the ids */
  51. sort_workerid_array(nworkers, workerid_array);
  52. /* Test that all workers are not combined workers already. */
  53. int i;
  54. for (i = 0; i < nworkers; i++)
  55. {
  56. int id = workerid_array[i];
  57. /* We only combine CPUs */
  58. STARPU_ASSERT(config->workers[id].perf_arch == STARPU_CPU_DEFAULT);
  59. STARPU_ASSERT(config->workers[id].worker_mask == STARPU_CPU);
  60. /* We only combine valid "basic" workers */
  61. if ((id < 0) || (id >= basic_worker_count))
  62. return -EINVAL;
  63. }
  64. /* Get an id for that combined worker. Note that this is not thread
  65. * safe because thhis method should only be called when the scheduler
  66. * is being initialized. */
  67. new_workerid = basic_worker_count + combined_worker_id;
  68. config->topology.ncombinedworkers++;
  69. #if 0
  70. fprintf(stderr, "COMBINED WORKERS ");
  71. for (i = 0; i < nworkers; i++)
  72. {
  73. fprintf(stderr, "%d ", workerid_array[i]);
  74. }
  75. fprintf(stderr, "into worker %d\n", new_workerid);
  76. #endif
  77. struct _starpu_combined_worker *combined_worker =
  78. &config->combined_workers[combined_worker_id];
  79. combined_worker->worker_size = nworkers;
  80. combined_worker->perf_arch = (enum starpu_perf_archtype) (STARPU_CPU_DEFAULT + nworkers - 1);
  81. combined_worker->worker_mask = STARPU_CPU;
  82. /* We assume that the memory node should either be that of the first
  83. * entry, and it is very likely that every worker in the combination
  84. * should be on the same memory node.*/
  85. int first_id = workerid_array[0];
  86. combined_worker->memory_node = config->workers[first_id].memory_node;
  87. /* Save the list of combined workers */
  88. memcpy(&combined_worker->combined_workerid, workerid_array, nworkers*sizeof(int));
  89. /* Note that we maintain both the cpu_set and the hwloc_cpu_set so that
  90. * the application is not forced to use hwloc when it is available. */
  91. #ifdef __GLIBC__
  92. CPU_ZERO(&combined_worker->cpu_set);
  93. #endif /* __GLIBC__ */
  94. #ifdef STARPU_HAVE_HWLOC
  95. combined_worker->hwloc_cpu_set = hwloc_bitmap_alloc();
  96. #endif
  97. for (i = 0; i < nworkers; i++)
  98. {
  99. #if defined(__GLIBC__) || defined(STARPU_HAVE_HWLOC)
  100. int id = workerid_array[i];
  101. #ifdef __GLIBC__
  102. #ifdef CPU_OR
  103. CPU_OR(&combined_worker->cpu_set,
  104. &combined_worker->cpu_set,
  105. &config->workers[id].initial_cpu_set);
  106. #else
  107. int j;
  108. for (j = 0; j < CPU_SETSIZE; j++)
  109. {
  110. if (CPU_ISSET(j, &config->workers[id].initial_cpu_set))
  111. CPU_SET(j, &combined_worker->cpu_set);
  112. }
  113. #endif
  114. #endif /* __GLIBC__ */
  115. #ifdef STARPU_HAVE_HWLOC
  116. hwloc_bitmap_or(combined_worker->hwloc_cpu_set,
  117. combined_worker->hwloc_cpu_set,
  118. config->workers[id].initial_hwloc_cpu_set);
  119. #endif
  120. #endif
  121. }
  122. return new_workerid;
  123. }
  124. int starpu_combined_worker_get_description(int workerid, int *worker_size, int **combined_workerid)
  125. {
  126. /* Check that this is the id of a combined worker */
  127. struct _starpu_combined_worker *worker;
  128. worker = _starpu_get_combined_worker_struct(workerid);
  129. STARPU_ASSERT(worker);
  130. if (worker_size)
  131. *worker_size = worker->worker_size;
  132. if (combined_workerid)
  133. *combined_workerid = worker->combined_workerid;
  134. return 0;
  135. }