13scheduling_contexts.doxy 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. /*
  2. * This file is part of the StarPU Handbook.
  3. // * Copyright (C) 2009--2011 Universit@'e de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012, 2013 Centre National de la Recherche Scientifique
  5. * Copyright (C) 2011, 2012 Institut National de Recherche en Informatique et Automatique
  6. * See the file version.doxy for copying conditions.
  7. */
  8. /*! \page SchedulingContexts Scheduling Contexts
  9. TODO: improve!
  10. \section GeneralIdeas General Ideas
  11. Scheduling contexts represent abstracts sets of workers that allow the
  12. programmers to control the distribution of computational resources
  13. (i.e. CPUs and GPUs) to concurrent parallel kernels. The main goal is
  14. to minimize interferences between the execution of multiple parallel
  15. kernels, by partitioning the underlying pool of workers using
  16. contexts.
  17. \section CreatingAContext Creating A Context
  18. By default, the application submits tasks to an initial context, which
  19. disposes of all the computation resources available to StarPU (all
  20. the workers). If the application programmer plans to launch several
  21. parallel kernels simultaneously, by default these kernels will be
  22. executed within this initial context, using a single scheduler
  23. policy(see \ref TaskSchedulingPolicy). Meanwhile, if the application
  24. programmer is aware of the demands of these kernels and of the
  25. specificity of the machine used to execute them, the workers can be
  26. divided between several contexts. These scheduling contexts will
  27. isolate the execution of each kernel and they will permit the use of a
  28. scheduling policy proper to each one of them.
  29. Scheduling Contexts may be created in two ways: either the programmers indicates
  30. the set of workers corresponding to each context (providing he knows the
  31. identifiers of the workers running within StarPU), or the programmer
  32. does not provide any worker list and leaves the Hypervisor assign
  33. workers to each context according to their needs (\ref SchedulingContextHypervisor)
  34. Both cases require a call to the function <c>starpu_sched_ctx_create</c>, which
  35. requires as input the worker list (the exact list or a NULL pointer) and the scheduling
  36. policy. The latter one can be a character list corresponding to the name of a StarPU
  37. predefined policy or the pointer to a custom policy. The function returns
  38. an identifier of the context created which you will use to
  39. indicate the context you want to submit the tasks to.
  40. \code{.c}
  41. /* the list of resources the context will manage */
  42. int workerids[3] = {1, 3, 10};
  43. /* indicate the scheduling policy to be used within the context, the list of
  44. workers assigned to it, the number of workers, the name of the context */
  45. int id_ctx = starpu_sched_ctx_create("dmda", workerids, 3, "my_ctx");
  46. /* let StarPU know that the following tasks will be submitted to this context */
  47. starpu_sched_ctx_set_task_context(id);
  48. /* submit the task to StarPU */
  49. starpu_task_submit(task);
  50. \endcode
  51. Note: Parallel greedy and parallel heft scheduling policies do not support the existence of several disjoint contexts on the machine.
  52. Combined workers are constructed depending on the entire topology of the machine, not only the one belonging to a context.
  53. \section ModifyingAContext Modifying A Context
  54. A scheduling context can be modified dynamically. The applications may
  55. change its requirements during the execution and the programmer can
  56. add additional workers to a context or remove if no longer needed. In
  57. the following example we have two scheduling contexts
  58. <c>sched_ctx1</c> and <c>sched_ctx2</c>. After executing a part of the
  59. tasks some of the workers of <c>sched_ctx1</c> will be moved to
  60. context <c>sched_ctx2</c>.
  61. \code{.c}
  62. /* the list of ressources that context 1 will give away */
  63. int workerids[3] = {1, 3, 10};
  64. /* add the workers to context 1 */
  65. starpu_sched_ctx_add_workers(workerids, 3, sched_ctx2);
  66. /* remove the workers from context 2 */
  67. starpu_sched_ctx_remove_workers(workerids, 3, sched_ctx1);
  68. \endcode
  69. \section SubmittingTasksToAContext Submitting Tasks To A Context
  70. The application may submit tasks to several contexts either
  71. simultaneously or sequnetially. If several threads of submission
  72. are used the function <c>starpu_sched_ctx_set_context</c> may be called just
  73. before <c>starpu_task_submit</c>. Thus StarPU considers that
  74. the current thread will submit tasks to the coresponding context.
  75. When the application may not assign a thread of submission to each
  76. context, the id of the context must be indicated by using the
  77. function <c>starpu_task_submit_to_ctx</c> or the field <c>STARPU_SCHED_CTX</c>
  78. for starpu_task_insert().
  79. \section DeletingAContext Deleting A Context
  80. When a context is no longer needed it must be deleted. The application
  81. can indicate which context should keep the resources of a deleted one.
  82. All the tasks of the context should be executed before doing this.
  83. Thus, the programmer may use either a barrier and then delete the context
  84. directly, or just indicate
  85. that other tasks will not be submitted later on to the context (such that when
  86. the last task is executed its workers will be moved to the inheritor)
  87. and delete the context at the end of the execution (when a barrier will
  88. be used eventually).
  89. \code{.c}
  90. /* when the context 2 is deleted context 1 inherits its resources */
  91. starpu_sched_ctx_set_inheritor(sched_ctx2, sched_ctx1);
  92. /* submit tasks to context 2 */
  93. for (i = 0; i < ntasks; i++)
  94. starpu_task_submit_to_ctx(task[i],sched_ctx2);
  95. /* indicate that context 2 finished submitting and that */
  96. /* as soon as the last task of context 2 finished executing */
  97. /* its workers can be moved to the inheritor context */
  98. starpu_sched_ctx_finished_submit(sched_ctx1);
  99. /* wait for the tasks of both contexts to finish */
  100. starpu_task_wait_for_all();
  101. /* delete context 2 */
  102. starpu_sched_ctx_delete(sched_ctx2);
  103. /* delete context 1 */
  104. starpu_sched_ctx_delete(sched_ctx1);
  105. \endcode
  106. \section EmptyingAContext Emptying A Context
  107. A context may have no resources at the begining or at a certain
  108. moment of the execution. Task can still be submitted to these contexts
  109. and they will be executed as soon as the contexts will have resources. A list
  110. of tasks pending to be executed is kept and when workers are added to
  111. the contexts these tasks start being submitted. However, if resources
  112. are never allocated to the context the program will not terminate.
  113. If these tasks have low
  114. priority the programmer can forbid the application to submit them
  115. by calling the function <c>starpu_sched_ctx_stop_task_submission()</c>.
  116. \section ContextsSharingWorkers Contexts Sharing Workers
  117. Contexts may share workers when a single context cannot execute
  118. efficiently enough alone on these workers or when the application
  119. decides to express a hierarchy of contexts. The workers apply an
  120. alogrithm of ``Round-Robin'' to chose the context on which they will
  121. ``pop'' next. By using the function
  122. <c>starpu_sched_ctx_set_turn_to_other_ctx</c>, the programmer can impose
  123. the <c>workerid</c> to ``pop'' in the context <c>sched_ctx_id</c>
  124. next.
  125. */