starpu_scheduler.h 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010, 2011 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. #ifndef __STARPU_SCHEDULER_H__
  17. #define __STARPU_SCHEDULER_H__
  18. #include <starpu.h>
  19. #include <starpu_config.h>
  20. #include <pthread.h>
  21. #ifdef STARPU_HAVE_HWLOC
  22. #include <hwloc.h>
  23. #endif
  24. struct starpu_task;
  25. struct starpu_machine_topology_s {
  26. unsigned nworkers;
  27. unsigned ncombinedworkers;
  28. #ifdef STARPU_HAVE_HWLOC
  29. hwloc_topology_t hwtopology;
  30. #else
  31. /* We maintain ABI compatibility with and without hwloc */
  32. void *dummy;
  33. #endif
  34. unsigned nhwcpus;
  35. unsigned nhwcudagpus;
  36. unsigned nhwopenclgpus;
  37. unsigned ncpus;
  38. unsigned ncudagpus;
  39. unsigned nopenclgpus;
  40. unsigned ngordon_spus;
  41. /* Where to bind workers ? */
  42. unsigned workers_bindid[STARPU_NMAXWORKERS];
  43. /* Which GPU(s) do we use for CUDA ? */
  44. unsigned workers_cuda_gpuid[STARPU_NMAXWORKERS];
  45. /* Which GPU(s) do we use for OpenCL ? */
  46. unsigned workers_opencl_gpuid[STARPU_NMAXWORKERS];
  47. };
  48. /* This structure contains all the methods that implement a scheduling policy.
  49. * An application may specify which scheduling strategy in the "sched_policy"
  50. * field of the starpu_conf structure passed to the starpu_init function. */
  51. struct starpu_sched_policy_s {
  52. /* Initialize the scheduling policy. */
  53. void (*init_sched)(struct starpu_sched_ctx *);
  54. /* Cleanup the scheduling policy. */
  55. void (*deinit_sched)(struct starpu_sched_ctx *);
  56. /* Insert a task into the scheduler. */
  57. int (*push_task)(struct starpu_task *, struct starpu_sched_ctx *);
  58. /* Notify the scheduler that a task was pushed on the worker. This
  59. * method is called when a task that was explicitely assigned to a
  60. * worker is scheduled. This method therefore permits to keep the state
  61. * of of the scheduler coherent even when StarPU bypasses the
  62. * scheduling strategy. */
  63. void (*push_task_notify)(struct starpu_task *, int workerid);
  64. /* Insert a priority task into the scheduler. */
  65. int (*push_prio_task)(struct starpu_task *, struct starpu_sched_ctx *);
  66. /* Get a task from the scheduler. The mutex associated to the worker is
  67. * already taken when this method is called. */
  68. struct starpu_task *(*pop_task)(void);
  69. /* Remove all available tasks from the scheduler (tasks are chained by
  70. * the means of the prev and next fields of the starpu_task
  71. * structure). The mutex associated to the worker is already taken
  72. * when this method is called. */
  73. struct starpu_task *(*pop_every_task)(void);
  74. /* This method is called every time a task has been executed. (optionnal) */
  75. void (*post_exec_hook)(struct starpu_task *);
  76. /* Name of the policy (optionnal) */
  77. const char *policy_name;
  78. /* Description of the policy (optionnal) */
  79. const char *policy_description;
  80. };
  81. struct starpu_sched_ctx {
  82. struct starpu_sched_policy_s *sched_policy; /*policy of the contex */
  83. int workerid[STARPU_NMAXWORKERS]; /*list of indices of workers */
  84. int nworkers_in_ctx; /*number of threads in contex */
  85. unsigned is_init_sched; /*we keep an init sched which we never delete */
  86. };
  87. struct starpu_device {
  88. int id;
  89. uint32_t type; /* what is the type of worker ? */
  90. };
  91. void starpu_create_sched_ctx(struct starpu_sched_ctx *sched_ctx, const char *policy_name, int *workerids_in_ctx, int nworkerids_in_ctx);
  92. void starpu_delete_sched_ctx(struct starpu_sched_ctx *sched_ctx);
  93. /* When there is no available task for a worker, StarPU blocks this worker on a
  94. condition variable. This function specifies which condition variable (and the
  95. associated mutex) should be used to block (and to wake up) a worker. Note that
  96. multiple workers may use the same condition variable. For instance, in the case
  97. of a scheduling strategy with a single task queue, the same condition variable
  98. would be used to block and wake up all workers. The initialization method of a
  99. scheduling strategy (init_sched) must call this function once per worker. */
  100. void starpu_worker_set_sched_condition(int workerid, pthread_cond_t *sched_cond, pthread_mutex_t *sched_mutex);
  101. /* Check if the worker specified by workerid can execute the codelet. */
  102. int starpu_worker_may_execute_task(unsigned workerid, struct starpu_task *task);
  103. /* The scheduling policy may put tasks directly into a worker's local queue so
  104. * that it is not always necessary to create its own queue when the local queue
  105. * is sufficient. If "back" not null, the task is put at the back of the queue
  106. * where the worker will pop tasks first. Setting "back" to 0 therefore ensures
  107. * a FIFO ordering. */
  108. int starpu_push_local_task(int workerid, struct starpu_task *task, int back);
  109. /*
  110. * Priorities
  111. */
  112. /* Provided for legacy reasons */
  113. #define STARPU_MIN_PRIO (starpu_sched_get_min_priority())
  114. #define STARPU_MAX_PRIO (starpu_sched_get_max_priority())
  115. /* By convention, the default priority level should be 0 so that we can
  116. * statically allocate tasks with a default priority. */
  117. #define STARPU_DEFAULT_PRIO 0
  118. int starpu_sched_get_min_priority(void);
  119. int starpu_sched_get_max_priority(void);
  120. void starpu_sched_set_min_priority(int min_prio);
  121. void starpu_sched_set_max_priority(int max_prio);
  122. /*
  123. * Parallel tasks
  124. */
  125. /* Register a new combined worker and get its identifier */
  126. int starpu_combined_worker_assign_workerid(int nworkers, int workerid_array[]);
  127. /* Initialize combined workers */
  128. void _starpu_sched_find_worker_combinations(struct starpu_machine_topology_s *topology);
  129. /* Get the description of a combined worker */
  130. int starpu_combined_worker_get_description(int workerid, int *worker_size, int **combined_workerid);
  131. /* Variant of starpu_worker_may_execute_task compatible with combined workers */
  132. int starpu_combined_worker_may_execute_task(unsigned workerid, struct starpu_task *task);
  133. /*
  134. * Data prefetching
  135. */
  136. /* Whether STARPU_PREFETCH was set */
  137. int starpu_get_prefetch_flag(void);
  138. /* Prefetch data for a given task on a given node */
  139. int starpu_prefetch_task_input_on_node(struct starpu_task *task, uint32_t node);
  140. /*
  141. * Performance predictions
  142. */
  143. /* Return the current date */
  144. double starpu_timing_now(void);
  145. /* Returns expected task duration in µs */
  146. double starpu_task_expected_length(struct starpu_task *task, enum starpu_perf_archtype arch);
  147. /* Returns an estimated speedup factor relative to CPU speed */
  148. double starpu_worker_get_relative_speedup(enum starpu_perf_archtype perf_archtype);
  149. /* Returns expected data transfer time in µs */
  150. double starpu_task_expected_data_transfer_time(uint32_t memory_node, struct starpu_task *task);
  151. /* Predict the transfer time (in µs) to move a handle to a memory node */
  152. double starpu_data_expected_transfer_time(starpu_data_handle handle, unsigned memory_node, starpu_access_mode mode);
  153. /* Returns expected power consumption in J */
  154. double starpu_task_expected_power(struct starpu_task *task, enum starpu_perf_archtype arch);
  155. /* Waits until all the tasks of a worker, already submitted, have been executed */
  156. int starpu_wait_for_all_tasks_of_worker(int workerid);
  157. /* Waits until all the tasks of a bunch of workers have been executed */
  158. int starpu_wait_for_all_tasks_of_workers(int *workerids_in_ctx, int nworkerids_in_ctx);
  159. #endif // __STARPU_SCHEDULER_H__