modular_random_prefetching.c 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2013 INRIA
  4. * Copyright (C) 2013 Simon Archipoff
  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 <starpu_sched_component.h>
  18. #include <starpu_scheduler.h>
  19. #define _STARPU_SCHED_NTASKS_THRESHOLD_DEFAULT 2
  20. #define _STARPU_SCHED_EXP_LEN_THRESHOLD_DEFAULT 1000000000.0
  21. /* Random scheduler with fifo queues for its scheduling window and its workers. */
  22. static void initialize_random_fifo_prefetching_center_policy(unsigned sched_ctx_id)
  23. {
  24. struct starpu_sched_tree *t;
  25. struct starpu_sched_component * random_component;
  26. t = starpu_sched_tree_create(sched_ctx_id);
  27. t->root = starpu_sched_component_fifo_create(t, NULL);
  28. random_component = starpu_sched_component_random_create(t, NULL);
  29. starpu_sched_component_connect(t->root, random_component);
  30. struct starpu_sched_component_fifo_data fifo_data =
  31. {
  32. .ntasks_threshold = starpu_get_env_number_default("STARPU_NTASKS_THRESHOLD", _STARPU_SCHED_NTASKS_THRESHOLD_DEFAULT),
  33. .exp_len_threshold = starpu_get_env_float_default("STARPU_EXP_LEN_THRESHOLD", _STARPU_SCHED_EXP_LEN_THRESHOLD_DEFAULT),
  34. };
  35. unsigned i;
  36. for(i = 0; i < starpu_worker_get_count() + starpu_combined_worker_get_count(); i++)
  37. {
  38. struct starpu_sched_component * worker_component = starpu_sched_component_worker_get(sched_ctx_id, i);
  39. struct starpu_sched_component * fifo_component = starpu_sched_component_fifo_create(t, &fifo_data);
  40. starpu_sched_component_connect(fifo_component, worker_component);
  41. starpu_sched_component_connect(random_component, fifo_component);
  42. }
  43. starpu_sched_tree_update_workers(t);
  44. starpu_sched_ctx_set_policy_data(sched_ctx_id, (void*)t);
  45. }
  46. static void deinitialize_random_fifo_prefetching_center_policy(unsigned sched_ctx_id)
  47. {
  48. struct starpu_sched_tree *tree = (struct starpu_sched_tree*)starpu_sched_ctx_get_policy_data(sched_ctx_id);
  49. starpu_sched_tree_destroy(tree);
  50. }
  51. struct starpu_sched_policy _starpu_sched_modular_random_prefetching_policy =
  52. {
  53. .init_sched = initialize_random_fifo_prefetching_center_policy,
  54. .deinit_sched = deinitialize_random_fifo_prefetching_center_policy,
  55. .add_workers = starpu_sched_tree_add_workers,
  56. .remove_workers = starpu_sched_tree_remove_workers,
  57. .push_task = starpu_sched_tree_push_task,
  58. .pop_task = starpu_sched_tree_pop_task,
  59. .pre_exec_hook = NULL,
  60. .post_exec_hook = NULL,
  61. .pop_every_task = NULL,
  62. .policy_name = "modular-random-prefetching",
  63. .policy_description = "random prefetching modular policy",
  64. .worker_type = STARPU_WORKER_LIST,
  65. };
  66. /* Random scheduler with priority queues for its scheduling window and its workers. */
  67. static void initialize_random_prio_prefetching_center_policy(unsigned sched_ctx_id)
  68. {
  69. struct starpu_sched_tree *t;
  70. struct starpu_sched_component *random_component;
  71. t = starpu_sched_tree_create(sched_ctx_id);
  72. t->root = starpu_sched_component_prio_create(t, NULL);
  73. random_component = starpu_sched_component_random_create(t, NULL);
  74. starpu_sched_component_connect(t->root, random_component);
  75. struct starpu_sched_component_prio_data prio_data =
  76. {
  77. .ntasks_threshold = starpu_get_env_number_default("STARPU_NTASKS_THRESHOLD", _STARPU_SCHED_NTASKS_THRESHOLD_DEFAULT),
  78. .exp_len_threshold = starpu_get_env_float_default("STARPU_EXP_LEN_THRESHOLD", _STARPU_SCHED_EXP_LEN_THRESHOLD_DEFAULT),
  79. };
  80. unsigned i;
  81. for(i = 0; i < starpu_worker_get_count() + starpu_combined_worker_get_count(); i++)
  82. {
  83. struct starpu_sched_component * worker_component = starpu_sched_component_worker_get(sched_ctx_id, i);
  84. struct starpu_sched_component * prio_component = starpu_sched_component_prio_create(t, &prio_data);
  85. starpu_sched_component_connect(prio_component, worker_component);
  86. starpu_sched_component_connect(random_component, prio_component);
  87. }
  88. starpu_sched_tree_update_workers(t);
  89. starpu_sched_ctx_set_policy_data(sched_ctx_id, (void*)t);
  90. }
  91. static void deinitialize_random_prio_prefetching_center_policy(unsigned sched_ctx_id)
  92. {
  93. struct starpu_sched_tree *tree = (struct starpu_sched_tree*)starpu_sched_ctx_get_policy_data(sched_ctx_id);
  94. starpu_sched_tree_destroy(tree);
  95. }
  96. struct starpu_sched_policy _starpu_sched_modular_random_prio_prefetching_policy =
  97. {
  98. .init_sched = initialize_random_prio_prefetching_center_policy,
  99. .deinit_sched = deinitialize_random_prio_prefetching_center_policy,
  100. .add_workers = starpu_sched_tree_add_workers,
  101. .remove_workers = starpu_sched_tree_remove_workers,
  102. .push_task = starpu_sched_tree_push_task,
  103. .pop_task = starpu_sched_tree_pop_task,
  104. .pre_exec_hook = NULL,
  105. .post_exec_hook = NULL,
  106. .pop_every_task = NULL,
  107. .policy_name = "modular-random-prio-prefetching",
  108. .policy_description = "random-prio prefetching modular policy",
  109. .worker_type = STARPU_WORKER_LIST,
  110. };