1 /* simple test to schedule a DAX file with the Min-Min algorithm. */
3 /* Copyright (c) 2009, 2010. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
11 #include "simdag/simdag.h"
16 XBT_LOG_NEW_DEFAULT_CATEGORY(test,
17 "Logging specific to this SimDag example");
19 typedef struct _WorkstationAttribute *WorkstationAttribute;
20 struct _WorkstationAttribute {
21 /* Earliest time at wich a workstation is ready to execute a task */
25 static void SD_workstation_allocate_attribute(SD_workstation_t workstation)
28 data = calloc(1, sizeof(struct _WorkstationAttribute));
29 SD_workstation_set_data(workstation, data);
32 static void SD_workstation_free_attribute(SD_workstation_t workstation)
34 free(SD_workstation_get_data(workstation));
35 SD_workstation_set_data(workstation, NULL);
38 static double SD_workstation_get_available_at(SD_workstation_t workstation)
40 WorkstationAttribute attr =
41 (WorkstationAttribute) SD_workstation_get_data(workstation);
42 return attr->available_at;
45 static void SD_workstation_set_available_at(SD_workstation_t workstation,
48 WorkstationAttribute attr =
49 (WorkstationAttribute) SD_workstation_get_data(workstation);
50 attr->available_at = time;
51 SD_workstation_set_data(workstation, attr);
55 static xbt_dynar_t get_ready_tasks(xbt_dynar_t dax)
58 xbt_dynar_t ready_tasks;
61 ready_tasks = xbt_dynar_new(sizeof(SD_task_t), NULL);
62 xbt_dynar_foreach(dax, i, task) {
63 if (SD_task_get_kind(task) == SD_TASK_COMP_SEQ &&
64 SD_task_get_state(task) == SD_SCHEDULABLE) {
65 xbt_dynar_push(ready_tasks, &task);
68 XBT_DEBUG("There are %lu ready tasks", xbt_dynar_length(ready_tasks));
73 static double finish_on_at(SD_task_t task, SD_workstation_t workstation)
75 volatile double result;
77 double data_available = 0.;
78 double redist_time = 0;
79 double last_data_available;
80 SD_task_t parent, grand_parent;
81 xbt_dynar_t parents, grand_parents;
83 SD_workstation_t *grand_parent_workstation_list;
85 parents = SD_task_get_parents(task);
87 if (xbt_dynar_length(parents)) {
88 /* compute last_data_available */
89 last_data_available = -1.0;
90 xbt_dynar_foreach(parents, i, parent) {
93 if (SD_task_get_kind(parent) == SD_TASK_COMM_E2E) {
94 grand_parents = SD_task_get_parents(parent);
96 if (xbt_dynar_length(grand_parents) > 1) {
97 XBT_ERROR("Warning: transfer %s has 2 parents",
98 SD_task_get_name(parent));
100 xbt_dynar_get_cpy(grand_parents, 0, &grand_parent);
102 grand_parent_workstation_list =
103 SD_task_get_workstation_list(grand_parent);
104 /* Estimate the redistribution time from this parent */
106 SD_route_get_communication_time(grand_parent_workstation_list
108 SD_task_get_amount(parent));
110 SD_task_get_finish_time(grand_parent) + redist_time;
112 xbt_dynar_free_container(&grand_parents);
115 /* no transfer, control dependency */
116 if (SD_task_get_kind(parent) == SD_TASK_COMP_SEQ) {
117 data_available = SD_task_get_finish_time(parent);
120 if (last_data_available < data_available)
121 last_data_available = data_available;
125 xbt_dynar_free_container(&parents);
127 result = MAX(SD_workstation_get_available_at(workstation),
128 last_data_available) +
129 SD_workstation_get_computation_time(workstation,
130 SD_task_get_amount(task));
132 xbt_dynar_free_container(&parents);
134 result = SD_workstation_get_available_at(workstation) +
135 SD_workstation_get_computation_time(workstation,
136 SD_task_get_amount(task));
141 static SD_workstation_t SD_task_get_best_workstation(SD_task_t task)
144 double EFT, min_EFT = -1.0;
145 const SD_workstation_t *workstations = SD_workstation_get_list();
146 int nworkstations = SD_workstation_get_number();
147 SD_workstation_t best_workstation;
149 best_workstation = workstations[0];
150 min_EFT = finish_on_at(task, workstations[0]);
152 for (i = 1; i < nworkstations; i++) {
153 EFT = finish_on_at(task, workstations[i]);
154 XBT_DEBUG("%s finishes on %s at %f",
155 SD_task_get_name(task),
156 SD_workstation_get_name(workstations[i]), EFT);
160 best_workstation = workstations[i];
164 return best_workstation;
167 static void output_xml(FILE * out, xbt_dynar_t dax)
169 unsigned int i, j, k;
170 int current_nworkstations;
171 const int nworkstations = SD_workstation_get_number();
172 const SD_workstation_t *workstations = SD_workstation_get_list();
174 SD_workstation_t *list;
176 fprintf(out, "<?xml version=\"1.0\"?>\n");
177 fprintf(out, "<grid_schedule>\n");
178 fprintf(out, " <grid_info>\n");
179 fprintf(out, " <info name=\"nb_clusters\" value=\"1\"/>\n");
180 fprintf(out, " <clusters>\n");
182 " <cluster id=\"1\" hosts=\"%d\" first_host=\"0\"/>\n",
184 fprintf(out, " </clusters>\n");
185 fprintf(out, " </grid_info>\n");
186 fprintf(out, " <node_infos>\n");
188 xbt_dynar_foreach(dax, i, task) {
189 fprintf(out, " <node_statistics>\n");
190 fprintf(out, " <node_property name=\"id\" value=\"%s\"/>\n",
191 SD_task_get_name(task));
192 fprintf(out, " <node_property name=\"type\" value=\"");
193 if (SD_task_get_kind(task) == SD_TASK_COMP_SEQ)
194 fprintf(out, "computation\"/>\n");
195 if (SD_task_get_kind(task) == SD_TASK_COMM_E2E)
196 fprintf(out, "transfer\"/>\n");
199 " <node_property name=\"start_time\" value=\"%.3f\"/>\n",
200 SD_task_get_start_time(task));
202 " <node_property name=\"end_time\" value=\"%.3f\"/>\n",
203 SD_task_get_finish_time(task));
204 fprintf(out, " <configuration>\n");
206 current_nworkstations = SD_task_get_workstation_count(task);
209 " <conf_property name=\"host_nb\" value=\"%d\"/>\n",
210 current_nworkstations);
212 fprintf(out, " <host_lists>\n");
213 list = SD_task_get_workstation_list(task);
214 for (j = 0; j < current_nworkstations; j++) {
215 for (k = 0; k < nworkstations; k++) {
216 if (!strcmp(SD_workstation_get_name(workstations[k]),
217 SD_workstation_get_name(list[j]))) {
218 fprintf(out, " <hosts start=\"%u\" nb=\"1\"/>\n",
221 " <conf_property name=\"cluster_id\" value=\"0\"/>\n");
226 fprintf(out, " </host_lists>\n");
227 fprintf(out, " </configuration>\n");
228 fprintf(out, " </node_statistics>\n");
230 fprintf(out, " </node_infos>\n");
231 fprintf(out, "</grid_schedule>\n");
234 int main(int argc, char **argv)
237 double finish_time, min_finish_time = -1.0;
238 SD_task_t task, selected_task = NULL;
239 xbt_dynar_t ready_tasks;
240 SD_workstation_t workstation, selected_workstation = NULL;
241 int total_nworkstations = 0;
242 const SD_workstation_t *workstations = NULL;
243 xbt_dynar_t dax, changed;
246 /* initialization of SD */
247 SD_init(&argc, argv);
249 /* Check our arguments */
251 XBT_INFO("Usage: %s platform_file dax_file [jedule_file]", argv[0]);
253 ("example: %s simulacrum_7_hosts.xml Montage_25.xml Montage_25.jed",
259 char *last = strrchr(argv[2], '.');
261 tracefilename = bprintf("%.*s.jed",
263 NULL ? strlen(argv[2]) : last -
266 tracefilename = xbt_strdup(argv[3]);
269 /* creation of the environment */
270 SD_create_environment(argv[1]);
272 /* Allocating the workstation attribute */
273 total_nworkstations = SD_workstation_get_number();
274 workstations = SD_workstation_get_list();
276 for (cursor = 0; cursor < total_nworkstations; cursor++)
277 SD_workstation_allocate_attribute(workstations[cursor]);
280 /* load the DAX file */
281 dax = SD_daxload(argv[2]);
283 xbt_dynar_foreach(dax, cursor, task) {
284 SD_task_watch(task, SD_DONE);
287 /* Schedule the root first */
288 xbt_dynar_get_cpy(dax, 0, &task);
289 workstation = SD_task_get_best_workstation(task);
290 SD_task_schedulel(task, 1, workstation);
292 while (!xbt_dynar_is_empty((changed = SD_simulate(-1.0)))) {
293 /* Get the set of ready tasks */
294 ready_tasks = get_ready_tasks(dax);
295 if (!xbt_dynar_length(ready_tasks)) {
296 xbt_dynar_free_container(&ready_tasks);
297 xbt_dynar_free_container(&changed);
298 /* there is no ready task, let advance the simulation */
301 /* For each ready task:
302 * get the workstation that minimizes the completion time.
303 * select the task that has the minimum completion time on
304 * its best workstation.
306 xbt_dynar_foreach(ready_tasks, cursor, task) {
307 XBT_DEBUG("%s is ready", SD_task_get_name(task));
308 workstation = SD_task_get_best_workstation(task);
309 finish_time = finish_on_at(task, workstation);
310 if (min_finish_time == -1. || finish_time < min_finish_time) {
311 min_finish_time = finish_time;
312 selected_task = task;
313 selected_workstation = workstation;
317 XBT_INFO("Schedule %s on %s", SD_task_get_name(selected_task),
318 SD_workstation_get_name(selected_workstation));
320 SD_task_schedulel(selected_task, 1, selected_workstation);
321 SD_workstation_set_available_at(selected_workstation, min_finish_time);
323 xbt_dynar_free_container(&ready_tasks);
324 /* reset the min_finish_time for the next set of ready tasks */
325 min_finish_time = -1.;
326 xbt_dynar_free_container(&changed);
329 XBT_INFO("Simulation Time: %f", SD_get_clock());
335 ("------------------- Produce the trace file---------------------------");
336 XBT_INFO("Producing the trace of the run into %s", tracefilename);
337 out = fopen(tracefilename, "w");
338 xbt_assert(out, "Cannot write to %s", tracefilename);
341 output_xml(out, dax);
346 xbt_dynar_free_container(&ready_tasks);
347 xbt_dynar_free_container(&changed);
349 xbt_dynar_foreach(dax, cursor, task) {
350 SD_task_destroy(task);
352 xbt_dynar_free_container(&dax);
354 for (cursor = 0; cursor < total_nworkstations; cursor++)
355 SD_workstation_free_attribute(workstations[cursor]);