1 /* Copyright (c) 2009, 2010. 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. */
8 #include "simdag/simdag.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_dotparse, sd, "Parsing DOT files");
19 #include <graphviz/cgraph.h>
21 #include <graphviz/agraph.h>
24 void dot_add_task(Agnode_t * dag_node);
25 void dot_add_input_dependencies(SD_task_t current_job, Agedge_t * edge);
26 void dot_add_output_dependencies(SD_task_t current_job, Agedge_t * edge);
27 xbt_dynar_t SD_dotload_generic(const char * filename);
29 static double dot_parse_double(const char *string)
36 //ret = sscanf(string, "%lg", &value);
38 value = strtod(string,&err);
41 XBT_WARN("Failed to convert string to double: %s\n",strerror(errno));
48 static int dot_parse_int(const char *string)
55 ret = sscanf(string, "%d", &value);
57 XBT_WARN("%s is not an integer", string);
61 static xbt_dynar_t result;
62 static xbt_dict_t jobs;
63 static xbt_dict_t files;
64 static xbt_dict_t computers;
65 static SD_task_t root_task, end_task;
66 static Agraph_t *dag_dot;
67 static bool schedule = true;
69 static void dump_res()
73 xbt_dynar_foreach(result, cursor, task) {
74 XBT_INFO("Task %d", cursor);
80 static void dot_task_free(void *task)
86 static void TRACE_sd_dotloader (SD_task_t task, const char *category)
89 if (strlen (category) != 0){
90 TRACE_category (category);
91 SD_task_set_category (task, category);
96 /** @brief loads a DOT file describing a DAG
98 * See http://www.graphviz.org/doc/info/lang.html
100 * To obtain information about transfers and tasks, two attributes are
101 * required : size on task (execution time in Flop) and size on edge
102 * (the amount of data transfer in bit).
103 * if they aren't here, there choose to be equal to zero.
105 xbt_dynar_t SD_dotload(const char *filename)
107 SD_dotload_generic(filename);
108 xbt_dynar_t computer = NULL;
109 xbt_dict_cursor_t dict_cursor;
111 xbt_dict_foreach(computers,dict_cursor,computer_name,computer){
112 xbt_dynar_free(&computer);
114 xbt_dict_free(&computers);
118 xbt_dynar_t SD_dotload_with_sched(const char *filename){
119 SD_dotload_generic(filename);
121 if(schedule == true){
122 xbt_dynar_t computer = NULL;
123 xbt_dict_cursor_t dict_cursor;
125 const SD_workstation_t *workstations = SD_workstation_get_list ();
126 xbt_dict_foreach(computers,dict_cursor,computer_name,computer){
127 int count_computer = dot_parse_int(computer_name);
128 unsigned int count=0;
130 SD_task_t task_previous = NULL;
131 xbt_dynar_foreach(computer,count,task){
132 // add dependency between the previous and the task to avoid
133 // parallel execution
135 if(task_previous != NULL &&
136 !SD_task_dependency_exists(task_previous, task))
137 SD_task_dependency_add(NULL, NULL, task_previous, task);
138 SD_task_schedulel(task, 1, workstations[count_computer]);
139 task_previous = task;
142 xbt_dynar_free(&computer);
144 xbt_dict_free(&computers);
145 if(acyclic_graph_detail(result))
148 XBT_WARN("There is at least one cycle in the provided task graph");
150 XBT_WARN("The scheduling is ignored");
155 xbt_dynar_t SD_dotload_generic(const char * filename)
157 xbt_assert(filename, "Unable to use a null file descriptor\n");
158 //dag_dot = agopen((char*)filename,Agstrictdirected,0);
159 FILE *in_file = fopen(filename, "r");
160 dag_dot = agread(in_file, NIL(Agdisc_t *));
162 result = xbt_dynar_new(sizeof(SD_task_t), dot_task_free);
163 files = xbt_dict_new_homogeneous(&dot_task_free);
164 jobs = xbt_dict_new_homogeneous(NULL);
165 computers = xbt_dict_new_homogeneous(NULL);
166 root_task = SD_task_create_comp_seq("root", NULL, 0);
167 /* by design the root task is always SCHEDULABLE */
168 __SD_task_set_state(root_task, SD_SCHEDULABLE);
170 xbt_dict_set(jobs, "root", root_task, NULL);
171 xbt_dynar_push(result, &root_task);
172 end_task = SD_task_create_comp_seq("end", NULL, 0);
173 xbt_dict_set(jobs, "end", end_task, NULL);
175 Agnode_t *dag_node = NULL;
176 for (dag_node = agfstnode(dag_dot); dag_node;
178 dag_node = agnxtnode(dag_dot, dag_node)
180 dag_node = agnxtnode(dag_node)
184 dot_add_task(dag_node);
187 xbt_dict_free(&jobs);
189 /* And now, post-process the files.
190 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
191 * Files not produced in the system are said to be produced by root task (top of DAG).
192 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
194 xbt_dict_cursor_t cursor;
197 xbt_dict_foreach(files, cursor, name, file) {
198 unsigned int cpt1, cpt2;
199 SD_task_t newfile = NULL;
200 SD_dependency_t depbefore, depafter;
201 if (xbt_dynar_is_empty(file->tasks_before)) {
202 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
204 SD_task_create_comm_e2e(file->name, NULL, file->amount);
205 SD_task_dependency_add(NULL, NULL, root_task, newfile);
206 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
207 xbt_dynar_push(result, &newfile);
209 } else if (xbt_dynar_is_empty(file->tasks_after)) {
210 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
212 SD_task_create_comm_e2e(file->name, NULL, file->amount);
213 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
214 SD_task_dependency_add(NULL, NULL, newfile, end_task);
215 xbt_dynar_push(result, &newfile);
218 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
219 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
220 if (depbefore->src == depafter->dst) {
222 ("File %s is produced and consumed by task %s. This loop dependency will prevent the execution of the task.",
223 file->name, depbefore->src->name);
226 SD_task_create_comm_e2e(file->name, NULL, file->amount);
227 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
228 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
229 xbt_dynar_push(result, &newfile);
235 /* Push end task last */
236 xbt_dynar_push(result, &end_task);
238 /* Free previous copy of the files */
239 xbt_dict_free(&files);
241 if(acyclic_graph_detail(result))
243 acyclic_graph_detail(result);
248 /* dot_add_task create a sd_task and all transfers required for this
249 * task. The execution time of the task is given by the attribute size.
250 * The unit of size is the Flop.*/
251 void dot_add_task(Agnode_t * dag_node)
253 char *name = agnameof(dag_node);
254 SD_task_t current_job;
255 double runtime = dot_parse_double(agget(dag_node, (char *) "size"));
257 XBT_DEBUG("See <job id=%s runtime=%s %.0f>", name,
258 agget(dag_node, (char *) "size"), runtime);
259 current_job = xbt_dict_get_or_null(jobs, name);
260 if (current_job == NULL) {
262 SD_task_create_comp_seq(name, NULL , runtime);
264 TRACE_sd_dotloader (current_job, agget (dag_node, (char*)"category"));
266 xbt_dict_set(jobs, name, current_job, NULL);
267 xbt_dynar_push(result, ¤t_job);
273 for (e = agfstin(dag_dot, dag_node); e; e = agnxtin(dag_dot, e))
275 for (e = agfstin(dag_node); e; e = agnxtin(e))
278 dot_add_input_dependencies(current_job, e);
281 if (count == 0 && current_job != root_task) {
282 SD_task_dependency_add(NULL, NULL, root_task, current_job);
286 for (e = agfstout(dag_dot, dag_node); e; e = agnxtout(dag_dot, e))
288 for (e = agfstout(dag_node); e; e = agnxtout(e))
292 dot_add_output_dependencies(current_job, e);
295 if (count == 0 && current_job != end_task) {
296 SD_task_dependency_add(NULL, NULL, current_job, end_task);
299 if(schedule || XBT_LOG_ISENABLED(sd_dotparse, xbt_log_priority_verbose)){
300 /* try to take the information to schedule the task only if all is
302 // performer is the computer which execute the task
303 unsigned long performer = -1;
304 char * char_performer = agget(dag_node, (char *) "performer");
305 if (char_performer != NULL)
306 performer = (long) dot_parse_int(char_performer);
308 // order is giving the task order on one computer
309 unsigned long order = -1;
310 char * char_order = agget(dag_node, (char *) "order");
311 if (char_order != NULL)
312 order = (long) dot_parse_int(char_order);
313 xbt_dynar_t computer = NULL;
314 //XBT_INFO("performer = %d, order=%d",performer,order);
315 if(performer != -1 && order != -1){
316 //necessary parameters are given
317 computer = xbt_dict_get_or_null(computers, char_performer);
318 if(computer == NULL){
319 computer = xbt_dynar_new(sizeof(SD_task_t), NULL);
320 xbt_dict_set(computers, char_performer, computer, NULL);
322 if(performer < xbt_lib_length(host_lib)){
323 // the wanted computer is available
324 SD_task_t *task_test = NULL;
325 if(order < computer->used)
326 task_test = xbt_dynar_get_ptr(computer,order);
327 if(task_test != NULL && *task_test != NULL && *task_test != current_job){
328 /*the user gives the same order to several tasks*/
330 XBT_VERB("The task %s starts on the computer %s at the position : %s like the task %s",
331 (*task_test)->name, char_performer, char_order, current_job->name);
333 //the parameter seems to be ok
334 xbt_dynar_set_as(computer, order, SD_task_t, current_job);
337 /*the platform has not enough processors to schedule the DAG like
340 XBT_VERB("The schedule is ignored, there are not enough computers");
344 //one of necessary parameters are not given
346 XBT_VERB("The schedule is ignored, the task %s is not correctly scheduled", current_job->name);
351 /* dot_add_output_dependencies create the dependencies between a task
352 * and a transfers. This is given by the edges in the dot file.
353 * The amount of data transfers is given by the attribute size on the
355 void dot_add_input_dependencies(SD_task_t current_job, Agedge_t * edge)
357 SD_task_t file = NULL;
358 char *name_tail=agnameof(agtail(edge));
359 char *name_head=agnameof(aghead(edge));
360 char *name = malloc((strlen(name_head)+strlen(name_tail)+6)*sizeof(char));
361 sprintf(name, "%s->%s", name_tail, name_head);
362 double size = dot_parse_double(agget(edge, (char *) "size"));
363 XBT_DEBUG("size : %e, get size : %s", size, agget(edge, (char *) "size"));
366 file = xbt_dict_get_or_null(files, name);
368 file = SD_task_create_comm_e2e(name, NULL, size);
370 TRACE_sd_dotloader (file, agget (edge, (char*)"category"));
372 xbt_dict_set(files, name, file, NULL);
374 if (SD_task_get_amount(file) != size) {
375 XBT_WARN("Ignoring file %s size redefinition from %.0f to %.0f",
376 name, SD_task_get_amount(file), size);
379 SD_task_dependency_add(NULL, NULL, file, current_job);
381 file = xbt_dict_get_or_null(jobs, name_tail);
383 SD_task_dependency_add(NULL, NULL, file, current_job);
389 /* dot_add_output_dependencies create the dependencies between a
390 * transfers and a task. This is given by the edges in the dot file.
391 * The amount of data transfers is given by the attribute size on the
393 void dot_add_output_dependencies(SD_task_t current_job, Agedge_t * edge)
396 char *name_tail=agnameof(agtail(edge));
397 char *name_head=agnameof(aghead(edge));
398 char *name = malloc((strlen(name_head)+strlen(name_tail)+6)*sizeof(char));
399 sprintf(name, "%s->%s", name_tail, name_head);
400 double size = dot_parse_double(agget(edge, (char *) "size"));
401 XBT_DEBUG("size : %e, get size : %s", size, agget(edge, (char *) "size"));
404 file = xbt_dict_get_or_null(files, name);
406 file = SD_task_create_comm_e2e(name, NULL, size);
408 TRACE_sd_dotloader (file, agget (edge, (char*)"category"));
410 xbt_dict_set(files, name, file, NULL);
412 if (SD_task_get_amount(file) != size) {
413 XBT_WARN("Ignoring file %s size redefinition from %.0f to %.0f",
414 name, SD_task_get_amount(file), size);
417 SD_task_dependency_add(NULL, NULL, current_job, file);
418 if (xbt_dynar_length(file->tasks_before) > 1) {
419 XBT_WARN("File %s created at more than one location...", file->name);
422 file = xbt_dict_get_or_null(jobs, name_head);
424 SD_task_dependency_add(NULL, NULL, current_job, file);