1 /* Copyright (c) 2009-2016. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 /* simple test to schedule a DAX file with the Min-Min algorithm. */
9 #include "simgrid/simdag.h"
11 #if SIMGRID_HAVE_JEDULE
12 #include "simgrid/jedule/jedule_sd_binding.h"
15 XBT_LOG_NEW_DEFAULT_CATEGORY(test, "Logging specific to this SimDag example");
17 typedef struct _HostAttribute *HostAttribute;
18 struct _HostAttribute {
19 /* Earliest time at which a host is ready to execute a task */
21 SD_task_t last_scheduled_task;
24 static double sg_host_get_available_at(sg_host_t host)
26 HostAttribute attr = (HostAttribute) sg_host_user(host);
27 return attr->available_at;
30 static void sg_host_set_available_at(sg_host_t host, double time)
32 HostAttribute attr = (HostAttribute) sg_host_user(host);
33 attr->available_at = time;
34 sg_host_user_set(host, attr);
37 static SD_task_t sg_host_get_last_scheduled_task( sg_host_t host){
38 HostAttribute attr = (HostAttribute) sg_host_user(host);
39 return attr->last_scheduled_task;
42 static void sg_host_set_last_scheduled_task(sg_host_t host, SD_task_t task){
43 HostAttribute attr = (HostAttribute) sg_host_user(host);
44 attr->last_scheduled_task=task;
45 sg_host_user_set(host, attr);
48 static xbt_dynar_t get_ready_tasks(xbt_dynar_t dax)
51 xbt_dynar_t ready_tasks;
54 ready_tasks = xbt_dynar_new(sizeof(SD_task_t), NULL);
55 xbt_dynar_foreach(dax, i, task) {
56 if (SD_task_get_kind(task) == SD_TASK_COMP_SEQ && SD_task_get_state(task) == SD_SCHEDULABLE) {
57 xbt_dynar_push(ready_tasks, &task);
60 XBT_DEBUG("There are %lu ready tasks", xbt_dynar_length(ready_tasks));
65 static double finish_on_at(SD_task_t task, sg_host_t host)
69 double data_available = 0.;
70 double redist_time = 0;
71 double last_data_available;
73 xbt_dynar_t parents = SD_task_get_parents(task);
75 if (!xbt_dynar_is_empty(parents)) {
76 /* compute last_data_available */
78 last_data_available = -1.0;
79 xbt_dynar_foreach(parents, i, parent) {
81 if (SD_task_get_kind(parent) == SD_TASK_COMM_E2E) {
82 sg_host_t * parent_host= SD_task_get_workstation_list(parent);
83 /* Estimate the redistribution time from this parent */
84 if (SD_task_get_amount(parent) <= 1e-6){
87 redist_time = sg_host_route_latency(parent_host[0], host) +
88 SD_task_get_amount(parent) / sg_host_route_bandwidth(parent_host[0], host);
90 data_available = SD_task_get_start_time(parent) + redist_time;
93 /* no transfer, control dependency */
94 if (SD_task_get_kind(parent) == SD_TASK_COMP_SEQ) {
95 data_available = SD_task_get_finish_time(parent);
98 if (last_data_available < data_available)
99 last_data_available = data_available;
102 xbt_dynar_free_container(&parents);
104 result = MAX(sg_host_get_available_at(host), last_data_available) + SD_task_get_amount(task)/sg_host_speed(host);
106 xbt_dynar_free_container(&parents);
108 result = sg_host_get_available_at(host) + SD_task_get_amount(task)/sg_host_speed(host);
113 static sg_host_t SD_task_get_best_host(SD_task_t task)
115 sg_host_t *hosts = sg_host_list();
116 int nhosts = sg_host_count();
117 sg_host_t best_host = hosts[0];
118 double min_EFT = finish_on_at(task, hosts[0]);
120 for (int i = 1; i < nhosts; i++) {
121 double EFT = finish_on_at(task, hosts[i]);
122 XBT_DEBUG("%s finishes on %s at %f", SD_task_get_name(task), sg_host_get_name(hosts[i]), EFT);
126 best_host = hosts[i];
133 int main(int argc, char **argv)
136 double min_finish_time = -1.0;
138 SD_task_t selected_task = NULL;
139 xbt_dynar_t ready_tasks;
140 sg_host_t selected_host = NULL;
141 char * tracefilename = NULL;
143 /* initialization of SD */
144 SD_init(&argc, argv);
146 /* Check our arguments */
147 xbt_assert(argc > 2, "Usage: %s platform_file dax_file [jedule_file]\n"
148 "\tExample: %s simulacrum_7_hosts.xml Montage_25.xml Montage_25.jed", argv[0], argv[0]);
151 tracefilename = xbt_strdup(argv[3]);
153 /* creation of the environment */
154 SD_create_environment(argv[1]);
156 /* Allocating the host attribute */
157 int total_nhosts = sg_host_count();
158 sg_host_t *hosts = sg_host_list();
160 for (cursor = 0; cursor < total_nhosts; cursor++)
161 sg_host_user_set(hosts[cursor], xbt_new0(struct _HostAttribute, 1));
163 /* load the DAX file */
164 xbt_dynar_t dax = SD_daxload(argv[2]);
166 xbt_dynar_foreach(dax, cursor, task) {
167 SD_task_watch(task, SD_DONE);
170 /* Schedule the root first */
171 xbt_dynar_get_cpy(dax, 0, &task);
172 sg_host_t host = SD_task_get_best_host(task);
173 SD_task_schedulel(task, 1, host);
174 xbt_dynar_t changed_tasks = xbt_dynar_new(sizeof(SD_task_t), NULL);
175 SD_simulate_with_update(-1.0, changed_tasks);
177 while (!xbt_dynar_is_empty(changed_tasks)) {
178 /* Get the set of ready tasks */
179 ready_tasks = get_ready_tasks(dax);
180 xbt_dynar_reset(changed_tasks);
182 if (xbt_dynar_is_empty(ready_tasks)) {
183 xbt_dynar_free_container(&ready_tasks);
184 /* there is no ready task, let advance the simulation */
185 SD_simulate_with_update(-1.0, changed_tasks);
188 /* For each ready task:
189 * get the host that minimizes the completion time.
190 * select the task that has the minimum completion time on its best host.
192 xbt_dynar_foreach(ready_tasks, cursor, task) {
193 XBT_DEBUG("%s is ready", SD_task_get_name(task));
194 host = SD_task_get_best_host(task);
195 double finish_time = finish_on_at(task, host);
196 if (min_finish_time < 0 || finish_time < min_finish_time) {
197 min_finish_time = finish_time;
198 selected_task = task;
199 selected_host = host;
203 XBT_INFO("Schedule %s on %s", SD_task_get_name(selected_task), sg_host_get_name(selected_host));
204 SD_task_schedulel(selected_task, 1, selected_host);
207 * SimDag allows tasks to be executed concurrently when they can by default.
208 * Yet schedulers take decisions assuming that tasks wait for resource availability to start.
209 * The solution (well crude hack is to keep track of the last task scheduled on a host and add a special type of
210 * dependency if needed to force the sequential execution meant by the scheduler.
211 * If the last scheduled task is already done, has failed or is a predecessor of the current task, no need for a
215 SD_task_t last_scheduled_task = sg_host_get_last_scheduled_task(selected_host);
216 if (last_scheduled_task && (SD_task_get_state(last_scheduled_task) != SD_DONE) &&
217 (SD_task_get_state(last_scheduled_task) != SD_FAILED) &&
218 !SD_task_dependency_exists(sg_host_get_last_scheduled_task(selected_host), selected_task))
219 SD_task_dependency_add("resource", NULL, last_scheduled_task, selected_task);
221 sg_host_set_last_scheduled_task(selected_host, selected_task);
222 sg_host_set_available_at(selected_host, min_finish_time);
224 xbt_dynar_free_container(&ready_tasks);
225 /* reset the min_finish_time for the next set of ready tasks */
226 min_finish_time = -1.;
227 xbt_dynar_reset(changed_tasks);
228 SD_simulate_with_update(-1.0, changed_tasks);
231 XBT_INFO("Simulation Time: %f", SD_get_clock());
232 XBT_INFO("------------------- Produce the trace file---------------------------");
233 XBT_INFO("Producing a jedule output (if active) of the run into %s", tracefilename?tracefilename:"minmin_test.jed");
234 #if SIMGRID_HAVE_JEDULE
235 jedule_sd_dump(tracefilename);
239 xbt_dynar_free_container(&ready_tasks);
240 xbt_dynar_free(&changed_tasks);
242 xbt_dynar_foreach(dax, cursor, task) {
243 SD_task_destroy(task);
245 xbt_dynar_free_container(&dax);
247 for (cursor = 0; cursor < total_nhosts; cursor++) {
248 free(sg_host_user(hosts[cursor]));
249 sg_host_user_set(hosts[cursor], NULL);