1 /* Copyright (c) 2006, 2007, 2008, 2009, 2010, 2011. 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"
9 #include "xbt/sysdep.h"
10 #include "xbt/dynar.h"
11 #include "instr/instr_private.h"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_task, sd,
14 "Logging specific to SimDag (task)");
16 static void __SD_task_remove_dependencies(SD_task_t task);
17 static void __SD_task_destroy_scheduling_data(SD_task_t task);
19 void* SD_task_new_f(void)
21 SD_task_t task = xbt_new0(s_SD_task_t, 1);
22 task->tasks_before = xbt_dynar_new(sizeof(SD_dependency_t), NULL);
23 task->tasks_after = xbt_dynar_new(sizeof(SD_dependency_t), NULL);
28 void SD_task_recycle_f(void *t)
30 SD_task_t task = (SD_task_t) t;
32 /* Reset the content */
33 task->kind = SD_TASK_NOT_TYPED;
34 task->state_hookup.prev = NULL;
35 task->state_hookup.next = NULL;
36 task->state_set = sd_global->not_scheduled_task_set;
37 xbt_swag_insert(task, task->state_set);
38 task->state = SD_NOT_SCHEDULED;
39 task->return_hookup.prev = NULL;
40 task->return_hookup.next = NULL;
44 task->start_time = -1.0;
45 task->finish_time = -1.0;
46 task->surf_action = NULL;
47 task->watch_points = 0;
50 xbt_dynar_reset(task->tasks_before);
51 xbt_dynar_reset(task->tasks_after);
52 task->unsatisfied_dependencies = 0;
53 task->is_not_ready = 0;
55 /* scheduling parameters */
56 task->workstation_nb = 0;
57 task->workstation_list = NULL;
58 task->computation_amount = NULL;
59 task->communication_amount = NULL;
63 void SD_task_free_f(void *t)
65 SD_task_t task = (SD_task_t)t;
67 xbt_dynar_free(&task->tasks_before);
68 xbt_dynar_free(&task->tasks_after);
73 * \brief Creates a new task.
75 * \param name the name of the task (can be \c NULL)
76 * \param data the user data you want to associate with the task (can be \c NULL)
77 * \param amount amount of the task
78 * \return the new task
79 * \see SD_task_destroy()
81 SD_task_t SD_task_create(const char *name, void *data, double amount)
83 SD_task_t task = xbt_mallocator_get(sd_global->task_mallocator);
85 /* general information */
86 task->data = data; /* user data */
87 task->name = xbt_strdup(name);
88 task->amount = amount;
89 task->remains = amount;
91 sd_global->task_number++;
94 task->category = NULL;
100 static XBT_INLINE SD_task_t SD_task_create_sized(const char *name,
101 void *data, double amount,
104 SD_task_t task = SD_task_create(name, data, amount);
105 task->communication_amount = xbt_new0(double, ws_count * ws_count);
106 task->computation_amount = xbt_new0(double, ws_count);
107 task->workstation_nb = ws_count;
108 task->workstation_list = xbt_new0(SD_workstation_t, ws_count);
112 /** @brief create a end-to-end communication task that can then be auto-scheduled
114 * Auto-scheduling mean that the task can be used with SD_task_schedulev(). This
115 * allows to specify the task costs at creation, and decouple them from the
116 * scheduling process where you just specify which resource should deliver the
119 * A end-to-end communication must be scheduled on 2 hosts, and the amount
120 * specified at creation is sent from hosts[0] to hosts[1].
122 SD_task_t SD_task_create_comm_e2e(const char *name, void *data,
125 SD_task_t res = SD_task_create_sized(name, data, amount, 2);
126 res->communication_amount[2] = amount;
127 res->kind = SD_TASK_COMM_E2E;
131 /** @brief create a sequential computation task that can then be auto-scheduled
133 * Auto-scheduling mean that the task can be used with SD_task_schedulev(). This
134 * allows to specify the task costs at creation, and decouple them from the
135 * scheduling process where you just specify which resource should deliver the
138 * A sequential computation must be scheduled on 1 host, and the amount
139 * specified at creation to be run on hosts[0].
141 * \param name the name of the task (can be \c NULL)
142 * \param data the user data you want to associate with the task (can be \c NULL)
143 * \param amount amount of compute work to be done by the task
144 * \return the new SD_TASK_COMP_SEQ typed task
146 SD_task_t SD_task_create_comp_seq(const char *name, void *data,
149 SD_task_t res = SD_task_create_sized(name, data, amount, 1);
150 res->computation_amount[0] = amount;
151 res->kind = SD_TASK_COMP_SEQ;
155 /** @brief create a parallel computation task that can then be auto-scheduled
157 * Auto-scheduling mean that the task can be used with SD_task_schedulev(). This
158 * allows to specify the task costs at creation, and decouple them from the
159 * scheduling process where you just specify which resource should deliver the
162 * A parallel computation can be scheduled on any number of host.
163 * The underlying speedup model is Amdahl's law.
164 * To be auto-scheduled, \see SD_task_distribute_comp_amdhal has to be called
166 * \param name the name of the task (can be \c NULL)
167 * \param data the user data you want to associate with the task (can be \c NULL)
168 * \param amount amount of compute work to be done by the task
169 * \param alpha purely serial fraction of the work to be done (in [0.;1.[)
170 * \return the new task
172 SD_task_t SD_task_create_comp_par_amdahl(const char *name, void *data,
173 double amount, double alpha)
175 xbt_assert(alpha < 1. && alpha >= 0.,
176 "Invalid parameter: alpha must be in [0.;1.[");
178 SD_task_t res = SD_task_create(name, data, amount);
180 res->kind = SD_TASK_COMP_PAR_AMDAHL;
184 /** @brief create a complex data redistribution task that can then be
187 * Auto-scheduling mean that the task can be used with SD_task_schedulev().
188 * This allows to specify the task costs at creation, and decouple them from
189 * the scheduling process where you just specify which resource should
192 * A data redistribution can be scheduled on any number of host.
193 * The assumed distribution is a 1D block distribution. Each host owns the same
194 * share of the \see amount.
195 * To be auto-scheduled, \see SD_task_distribute_comm_mxn_1d_block has to be
197 * \param name the name of the task (can be \c NULL)
198 * \param data the user data you want to associate with the task (can be
200 * \param amount amount of data to redistribute by the task
201 * \return the new task
203 SD_task_t SD_task_create_comm_par_mxn_1d_block(const char *name, void *data,
206 SD_task_t res = SD_task_create(name, data, amount);
207 res->workstation_list=NULL;
208 res->kind = SD_TASK_COMM_PAR_MXN_1D_BLOCK;
213 * \brief Destroys a task.
215 * The user data (if any) should have been destroyed first.
217 * \param task the task you want to destroy
218 * \see SD_task_create()
220 void SD_task_destroy(SD_task_t task)
222 XBT_DEBUG("Destroying task %s...", SD_task_get_name(task));
224 __SD_task_remove_dependencies(task);
225 /* if the task was scheduled or runnable we have to free the scheduling parameters */
226 if (__SD_task_is_scheduled_or_runnable(task))
227 __SD_task_destroy_scheduling_data(task);
228 if (task->state_set != NULL) /* would be null if just created */
229 xbt_swag_remove(task, task->state_set);
231 xbt_swag_remove(task, sd_global->return_set);
233 xbt_free(task->name);
235 if (task->surf_action != NULL)
236 surf_workstation_model->action_unref(task->surf_action);
238 xbt_free(task->workstation_list);
239 xbt_free(task->communication_amount);
240 xbt_free(task->computation_amount);
243 if (task->category) xbt_free(task->category);
246 xbt_mallocator_release(sd_global->task_mallocator,task);
247 sd_global->task_number--;
249 XBT_DEBUG("Task destroyed.");
253 * \brief Returns the user data of a task
256 * \return the user data associated with this task (can be \c NULL)
257 * \see SD_task_set_data()
259 void *SD_task_get_data(SD_task_t task)
265 * \brief Sets the user data of a task
267 * The new data can be \c NULL. The old data should have been freed first
268 * if it was not \c NULL.
271 * \param data the new data you want to associate with this task
272 * \see SD_task_get_data()
274 void SD_task_set_data(SD_task_t task, void *data)
280 * \brief Sets the rate of a task
282 * This will change the network bandwidth a task can use. This rate
283 * depends on both the nominal bandwidth on the route onto which the task is
284 * scheduled (\see SD_task_get_current_bandwidth) and the amount of data to
287 * To divide the nominal bandwidth by 2, the rate then has to be :
288 * rate = bandwidth/(2*amount)
290 * \param task a \see SD_TASK_COMM_E2E task (end-to-end communication)
291 * \param rate the new rate you want to associate with this task.
293 void SD_task_set_rate(SD_task_t task, double rate)
295 xbt_assert(task->kind == SD_TASK_COMM_E2E,
296 "The rate can be modified for end-to-end communications only.");
302 * \brief Returns the state of a task
305 * \return the current \ref e_SD_task_state_t "state" of this task:
306 * #SD_NOT_SCHEDULED, #SD_SCHEDULED, #SD_RUNNABLE, #SD_RUNNING, #SD_DONE or #SD_FAILED
307 * \see e_SD_task_state_t
309 e_SD_task_state_t SD_task_get_state(SD_task_t task)
314 /* Changes the state of a task. Updates the swags and the flag sd_global->watch_point_reached.
316 void __SD_task_set_state(SD_task_t task, e_SD_task_state_t new_state)
318 xbt_swag_remove(task, task->state_set);
320 case SD_NOT_SCHEDULED:
321 task->state_set = sd_global->not_scheduled_task_set;
324 task->state_set = sd_global->schedulable_task_set;
327 task->state_set = sd_global->scheduled_task_set;
330 task->state_set = sd_global->runnable_task_set;
333 task->state_set = sd_global->in_fifo_task_set;
336 task->state_set = sd_global->running_task_set;
338 surf_workstation_model->action_get_start_time(task->surf_action);
341 task->state_set = sd_global->done_task_set;
343 surf_workstation_model->action_get_finish_time(task->surf_action);
346 jedule_log_sd_event(task);
350 task->state_set = sd_global->failed_task_set;
353 xbt_die( "Invalid state");
355 xbt_swag_insert(task, task->state_set);
356 task->state = new_state;
358 if (task->watch_points & new_state) {
359 XBT_VERB("Watch point reached with task '%s'!", SD_task_get_name(task));
360 sd_global->watch_point_reached = 1;
361 SD_task_unwatch(task, new_state); /* remove the watch point */
366 * \brief Returns the name of a task
369 * \return the name of this task (can be \c NULL)
371 const char *SD_task_get_name(SD_task_t task)
376 /** @brief Allows to change the name of a task */
377 void SD_task_set_name(SD_task_t task, const char *name)
379 xbt_free(task->name);
380 task->name = xbt_strdup(name);
383 /** @brief Returns the dynar of the parents of a task
386 * \return a newly allocated dynar comprising the parents of this task
389 xbt_dynar_t SD_task_get_parents(SD_task_t task)
395 parents = xbt_dynar_new(sizeof(SD_task_t), NULL);
396 xbt_dynar_foreach(task->tasks_before, i, dep) {
397 xbt_dynar_push(parents, &(dep->src));
402 /** @brief Returns the dynar of the parents of a task
405 * \return a newly allocated dynar comprising the parents of this task
407 xbt_dynar_t SD_task_get_children(SD_task_t task)
410 xbt_dynar_t children;
413 children = xbt_dynar_new(sizeof(SD_task_t), NULL);
414 xbt_dynar_foreach(task->tasks_after, i, dep) {
415 xbt_dynar_push(children, &(dep->dst));
421 * \brief Returns the amount of workstations involved in a task
423 * Only call this on already scheduled tasks!
426 int SD_task_get_workstation_count(SD_task_t task)
428 return task->workstation_nb;
432 * \brief Returns the list of workstations involved in a task
434 * Only call this on already scheduled tasks!
437 SD_workstation_t *SD_task_get_workstation_list(SD_task_t task)
439 return task->workstation_list;
443 * \brief Returns the total amount of work contained in a task
446 * \return the total amount of work (computation or data transfer) for this task
447 * \see SD_task_get_remaining_amount()
449 double SD_task_get_amount(SD_task_t task)
455 * \brief Returns the alpha parameter of a SD_TASK_COMP_PAR_AMDAH task
457 * \param task a parallel task assuming Amdahl's law as speedup model
458 * \return the alpha parameter (serial part of a task in percent) for this task
460 double SD_task_get_alpha(SD_task_t task)
462 xbt_assert(SD_task_get_kind(task) == SD_TASK_COMP_PAR_AMDAHL,
463 "Alpha parameter is not defined for this kink of task");
469 * \brief Returns the remaining amount work to do till the completion of a task
472 * \return the remaining amount of work (computation or data transfer) of this task
473 * \see SD_task_get_amount()
475 double SD_task_get_remaining_amount(SD_task_t task)
477 if (task->surf_action)
478 return surf_workstation_model->get_remains(task->surf_action);
480 return task->remains;
483 int SD_task_get_kind(SD_task_t task)
488 /** @brief Displays debugging informations about a task */
489 void SD_task_dump(SD_task_t task)
491 unsigned int counter;
492 SD_dependency_t dependency;
495 XBT_INFO("Displaying task %s", SD_task_get_name(task));
496 statename = bprintf("%s %s %s %s %s %s %s %s",
497 (task->state & SD_NOT_SCHEDULED ? "not scheduled" :
499 (task->state & SD_SCHEDULABLE ? "schedulable" : ""),
500 (task->state & SD_SCHEDULED ? "scheduled" : ""),
501 (task->state & SD_RUNNABLE ? "runnable" :
503 (task->state & SD_IN_FIFO ? "in fifo" : ""),
504 (task->state & SD_RUNNING ? "running" : ""),
505 (task->state & SD_DONE ? "done" : ""),
506 (task->state & SD_FAILED ? "failed" : ""));
507 XBT_INFO(" - state: %s", statename);
510 if (task->kind != 0) {
511 switch (task->kind) {
512 case SD_TASK_COMM_E2E:
513 XBT_INFO(" - kind: end-to-end communication");
515 case SD_TASK_COMP_SEQ:
516 XBT_INFO(" - kind: sequential computation");
518 case SD_TASK_COMP_PAR_AMDAHL:
519 XBT_INFO(" - kind: parallel computation following Amdahl's law");
521 case SD_TASK_COMM_PAR_MXN_1D_BLOCK:
522 XBT_INFO(" - kind: MxN data redistribution assuming 1D block distribution");
525 XBT_INFO(" - (unknown kind %d)", task->kind);
528 XBT_INFO(" - amount: %.0f", SD_task_get_amount(task));
529 if (task->kind == SD_TASK_COMP_PAR_AMDAHL)
530 XBT_INFO(" - alpha: %.2f", task->alpha);
531 XBT_INFO(" - Dependencies to satisfy: %d", task->unsatisfied_dependencies);
532 if (!xbt_dynar_is_empty(task->tasks_before)) {
533 XBT_INFO(" - pre-dependencies:");
534 xbt_dynar_foreach(task->tasks_before, counter, dependency) {
535 XBT_INFO(" %s", SD_task_get_name(dependency->src));
538 if (!xbt_dynar_is_empty(task->tasks_after)) {
539 XBT_INFO(" - post-dependencies:");
540 xbt_dynar_foreach(task->tasks_after, counter, dependency) {
541 XBT_INFO(" %s", SD_task_get_name(dependency->dst));
546 /** @brief Dumps the task in dotty formalism into the FILE* passed as second argument */
547 void SD_task_dotty(SD_task_t task, void *out)
549 unsigned int counter;
550 SD_dependency_t dependency;
551 fprintf(out, " T%p [label=\"%.20s\"", task, task->name);
552 switch (task->kind) {
553 case SD_TASK_COMM_E2E:
554 case SD_TASK_COMM_PAR_MXN_1D_BLOCK:
555 fprintf(out, ", shape=box");
557 case SD_TASK_COMP_SEQ:
558 case SD_TASK_COMP_PAR_AMDAHL:
559 fprintf(out, ", shape=circle");
562 xbt_die("Unknown task type!");
564 fprintf(out, "];\n");
565 xbt_dynar_foreach(task->tasks_before, counter, dependency) {
566 fprintf(out, " T%p -> T%p;\n", dependency->src, dependency->dst);
570 /* Destroys a dependency between two tasks.
572 static void __SD_task_dependency_destroy(void *dependency)
574 xbt_free(((SD_dependency_t)dependency)->name);
575 xbt_free(dependency);
579 * \brief Adds a dependency between two tasks
581 * \a dst will depend on \a src, ie \a dst will not start before \a src is finished.
582 * Their \ref e_SD_task_state_t "state" must be #SD_NOT_SCHEDULED, #SD_SCHEDULED or #SD_RUNNABLE.
584 * \param name the name of the new dependency (can be \c NULL)
585 * \param data the user data you want to associate with this dependency (can be \c NULL)
586 * \param src the task which must be executed first
587 * \param dst the task you want to make depend on \a src
588 * \see SD_task_dependency_remove()
590 void SD_task_dependency_add(const char *name, void *data, SD_task_t src,
597 SD_dependency_t dependency;
599 dynar = src->tasks_after;
600 length = xbt_dynar_length(dynar);
604 "Cannot add a dependency between task '%s' and itself",
605 SD_task_get_name(src));
607 if (!__SD_task_is_not_scheduled(src) && !__SD_task_is_schedulable(src)
608 && !__SD_task_is_scheduled_or_runnable(src) && !__SD_task_is_running(src))
610 "Task '%s' must be SD_NOT_SCHEDULED, SD_SCHEDULABLE, SD_SCHEDULED or SD_RUNNABLE"
612 SD_task_get_name(src));
614 if (!__SD_task_is_not_scheduled(dst) && !__SD_task_is_schedulable(dst)
615 && !__SD_task_is_scheduled_or_runnable(dst))
617 "Task '%s' must be SD_NOT_SCHEDULED, SD_SCHEDULABLE, SD_SCHEDULED or SD_RUNNABLE",
618 SD_task_get_name(dst));
620 XBT_DEBUG("SD_task_dependency_add: src = %s, dst = %s",
621 SD_task_get_name(src), SD_task_get_name(dst));
622 for (i = 0; i < length && !found; i++) {
623 xbt_dynar_get_cpy(dynar, i, &dependency);
624 found = (dependency->dst == dst);
625 XBT_DEBUG("Dependency %d: dependency->dst = %s", i,
626 SD_task_get_name(dependency->dst));
631 "A dependency already exists between task '%s' and task '%s'",
632 SD_task_get_name(src), SD_task_get_name(dst));
634 dependency = xbt_new(s_SD_dependency_t, 1);
636 dependency->name = xbt_strdup(name); /* xbt_strdup is cleaver enough to deal with NULL args itself */
637 dependency->data = data;
638 dependency->src = src;
639 dependency->dst = dst;
641 /* src must be executed before dst */
642 xbt_dynar_push(src->tasks_after, &dependency);
643 xbt_dynar_push(dst->tasks_before, &dependency);
645 dst->unsatisfied_dependencies++;
648 /* if the task was runnable, then dst->tasks_before is not empty anymore,
649 so we must go back to state SD_SCHEDULED */
650 if (__SD_task_is_runnable(dst)) {
652 ("SD_task_dependency_add: %s was runnable and becomes scheduled!",
653 SD_task_get_name(dst));
654 __SD_task_set_state(dst, SD_SCHEDULED);
659 * \brief Indicates whether there is a dependency between two tasks.
662 * \param dst a task depending on \a src
664 * If src is NULL, checks whether dst has any pre-dependency.
665 * If dst is NULL, checks whether src has any post-dependency.
667 int SD_task_dependency_exists(SD_task_t src, SD_task_t dst)
669 unsigned int counter;
670 SD_dependency_t dependency;
672 xbt_assert(src != NULL
674 "Invalid parameter: both src and dst are NULL");
678 xbt_dynar_foreach(src->tasks_after, counter, dependency) {
679 if (dependency->dst == dst)
683 return xbt_dynar_length(src->tasks_after);
686 return xbt_dynar_length(dst->tasks_before);
692 * \brief Remove a dependency between two tasks
695 * \param dst a task depending on \a src
696 * \see SD_task_dependency_add()
698 void SD_task_dependency_remove(SD_task_t src, SD_task_t dst)
705 SD_dependency_t dependency;
707 /* remove the dependency from src->tasks_after */
708 dynar = src->tasks_after;
709 length = xbt_dynar_length(dynar);
711 for (i = 0; i < length && !found; i++) {
712 xbt_dynar_get_cpy(dynar, i, &dependency);
713 if (dependency->dst == dst) {
714 xbt_dynar_remove_at(dynar, i, NULL);
720 "No dependency found between task '%s' and '%s': task '%s' is not a successor of task '%s'",
721 SD_task_get_name(src), SD_task_get_name(dst),
722 SD_task_get_name(dst), SD_task_get_name(src));
724 /* remove the dependency from dst->tasks_before */
725 dynar = dst->tasks_before;
726 length = xbt_dynar_length(dynar);
729 for (i = 0; i < length && !found; i++) {
730 xbt_dynar_get_cpy(dynar, i, &dependency);
731 if (dependency->src == src) {
732 xbt_dynar_remove_at(dynar, i, NULL);
733 __SD_task_dependency_destroy(dependency);
734 dst->unsatisfied_dependencies--;
739 /* should never happen... */
741 "SimDag error: task '%s' is a successor of '%s' but task '%s' is not a predecessor of task '%s'",
742 SD_task_get_name(dst), SD_task_get_name(src),
743 SD_task_get_name(src), SD_task_get_name(dst));
745 /* if the task was scheduled and dst->tasks_before is empty now, we can make it runnable */
747 if (dst->unsatisfied_dependencies == 0) {
748 if (__SD_task_is_scheduled(dst))
749 __SD_task_set_state(dst, SD_RUNNABLE);
751 __SD_task_set_state(dst, SD_SCHEDULABLE);
754 if (dst->is_not_ready == 0)
755 __SD_task_set_state(dst, SD_SCHEDULABLE);
757 /* __SD_print_dependencies(src);
758 __SD_print_dependencies(dst); */
762 * \brief Returns the user data associated with a dependency between two tasks
765 * \param dst a task depending on \a src
766 * \return the user data associated with this dependency (can be \c NULL)
767 * \see SD_task_dependency_add()
769 void *SD_task_dependency_get_data(SD_task_t src, SD_task_t dst)
776 SD_dependency_t dependency;
778 dynar = src->tasks_after;
779 length = xbt_dynar_length(dynar);
781 for (i = 0; i < length && !found; i++) {
782 xbt_dynar_get_cpy(dynar, i, &dependency);
783 found = (dependency->dst == dst);
786 THROWF(arg_error, 0, "No dependency found between task '%s' and '%s'",
787 SD_task_get_name(src), SD_task_get_name(dst));
788 return dependency->data;
791 /* temporary function for debugging */
792 static void __SD_print_watch_points(SD_task_t task)
794 static const int state_masks[] =
795 { SD_SCHEDULABLE, SD_SCHEDULED, SD_RUNNING, SD_RUNNABLE, SD_DONE,
798 static const char *state_names[] =
799 { "schedulable", "scheduled", "running", "runnable", "done",
804 XBT_INFO("Task '%s' watch points (%x): ", SD_task_get_name(task),
808 for (i = 0; i < 5; i++) {
809 if (task->watch_points & state_masks[i])
810 XBT_INFO("%s ", state_names[i]);
815 * \brief Adds a watch point to a task
817 * SD_simulate() will stop as soon as the \ref e_SD_task_state_t "state" of this
818 * task becomes the one given in argument. The
819 * watch point is then automatically removed.
822 * \param state the \ref e_SD_task_state_t "state" you want to watch
823 * (cannot be #SD_NOT_SCHEDULED)
824 * \see SD_task_unwatch()
826 void SD_task_watch(SD_task_t task, e_SD_task_state_t state)
828 if (state & SD_NOT_SCHEDULED)
830 "Cannot add a watch point for state SD_NOT_SCHEDULED");
832 task->watch_points = task->watch_points | state;
833 /* __SD_print_watch_points(task); */
837 * \brief Removes a watch point from a task
840 * \param state the \ref e_SD_task_state_t "state" you no longer want to watch
841 * \see SD_task_watch()
843 void SD_task_unwatch(SD_task_t task, e_SD_task_state_t state)
845 xbt_assert(state != SD_NOT_SCHEDULED,
846 "SimDag error: Cannot have a watch point for state SD_NOT_SCHEDULED");
848 task->watch_points = task->watch_points & ~state;
849 /* __SD_print_watch_points(task); */
853 * \brief Returns an approximative estimation of the execution time of a task.
855 * The estimation is very approximative because the value returned is the time
856 * the task would take if it was executed now and if it was the only task.
858 * \param task the task to evaluate
859 * \param workstation_nb number of workstations on which the task would be executed
860 * \param workstation_list the workstations on which the task would be executed
861 * \param computation_amount computation amount for each workstation
862 * \param communication_amount communication amount between each pair of workstations
865 double SD_task_get_execution_time(SD_task_t task,
867 const SD_workstation_t *
869 const double *computation_amount,
870 const double *communication_amount)
872 double time, max_time = 0.0;
874 xbt_assert(workstation_nb > 0, "Invalid parameter");
876 /* the task execution time is the maximum execution time of the parallel tasks */
878 for (i = 0; i < workstation_nb; i++) {
880 if (computation_amount != NULL)
882 SD_workstation_get_computation_time(workstation_list[i],
883 computation_amount[i]);
885 if (communication_amount != NULL)
886 for (j = 0; j < workstation_nb; j++) {
888 SD_route_get_communication_time(workstation_list[i],
890 communication_amount[i *
895 if (time > max_time) {
902 static XBT_INLINE void SD_task_do_schedule(SD_task_t task)
904 if (!__SD_task_is_not_scheduled(task) && !__SD_task_is_schedulable(task))
905 THROWF(arg_error, 0, "Task '%s' has already been scheduled",
906 SD_task_get_name(task));
908 /* update the task state */
909 if (task->unsatisfied_dependencies == 0)
910 __SD_task_set_state(task, SD_RUNNABLE);
912 __SD_task_set_state(task, SD_SCHEDULED);
916 * \brief Schedules a task
918 * The task state must be #SD_NOT_SCHEDULED.
919 * Once scheduled, a task will be executed as soon as possible in SD_simulate(),
920 * i.e. when its dependencies are satisfied.
922 * \param task the task you want to schedule
923 * \param workstation_count number of workstations on which the task will be executed
924 * \param workstation_list the workstations on which the task will be executed
925 * \param computation_amount computation amount for each workstation
926 * \param communication_amount communication amount between each pair of workstations
927 * \param rate task execution speed rate
928 * \see SD_task_unschedule()
930 void SD_task_schedule(SD_task_t task, int workstation_count,
931 const SD_workstation_t * workstation_list,
932 const double *computation_amount,
933 const double *communication_amount, double rate)
935 int communication_nb;
936 task->workstation_nb = 0;
938 xbt_assert(workstation_count > 0, "workstation_nb must be positive");
940 task->workstation_nb = workstation_count;
943 if (computation_amount) {
944 task->computation_amount = xbt_realloc(task->computation_amount,
945 sizeof(double) * workstation_count);
946 memcpy(task->computation_amount, computation_amount,
947 sizeof(double) * workstation_count);
949 xbt_free(task->computation_amount);
950 task->computation_amount = NULL;
953 communication_nb = workstation_count * workstation_count;
954 if (communication_amount) {
955 task->communication_amount = xbt_realloc(task->communication_amount,
956 sizeof(double) * communication_nb);
957 memcpy(task->communication_amount, communication_amount,
958 sizeof(double) * communication_nb);
960 xbt_free(task->communication_amount);
961 task->communication_amount = NULL;
964 task->workstation_list =
965 xbt_realloc(task->workstation_list,
966 sizeof(SD_workstation_t) * workstation_count);
967 memcpy(task->workstation_list, workstation_list,
968 sizeof(SD_workstation_t) * workstation_count);
970 SD_task_do_schedule(task);
974 * \brief Unschedules a task
976 * The task state must be #SD_SCHEDULED, #SD_RUNNABLE, #SD_RUNNING or #SD_FAILED.
977 * If you call this function, the task state becomes #SD_NOT_SCHEDULED.
978 * Call SD_task_schedule() to schedule it again.
980 * \param task the task you want to unschedule
981 * \see SD_task_schedule()
983 void SD_task_unschedule(SD_task_t task)
985 if (task->state_set != sd_global->scheduled_task_set &&
986 task->state_set != sd_global->runnable_task_set &&
987 task->state_set != sd_global->running_task_set &&
988 task->state_set != sd_global->failed_task_set)
990 "Task %s: the state must be SD_SCHEDULED, SD_RUNNABLE, SD_RUNNING or SD_FAILED",
991 SD_task_get_name(task));
993 if (__SD_task_is_scheduled_or_runnable(task) /* if the task is scheduled or runnable */
994 && ((task->kind == SD_TASK_COMP_PAR_AMDAHL) ||
995 (task->kind == SD_TASK_COMM_PAR_MXN_1D_BLOCK))) { /* Don't free scheduling data for typed tasks */
996 __SD_task_destroy_scheduling_data(task);
997 task->workstation_list=NULL;
998 task->workstation_nb = 0;
1001 if (__SD_task_is_running(task)) /* the task should become SD_FAILED */
1002 surf_workstation_model->action_cancel(task->surf_action);
1004 if (task->unsatisfied_dependencies == 0)
1005 __SD_task_set_state(task, SD_SCHEDULABLE);
1007 __SD_task_set_state(task, SD_NOT_SCHEDULED);
1009 task->remains = task->amount;
1010 task->start_time = -1.0;
1013 /* Destroys the data memorized by SD_task_schedule.
1014 * Task state must be SD_SCHEDULED or SD_RUNNABLE.
1016 static void __SD_task_destroy_scheduling_data(SD_task_t task)
1018 if (!__SD_task_is_scheduled_or_runnable(task)
1019 && !__SD_task_is_in_fifo(task))
1020 THROWF(arg_error, 0,
1021 "Task '%s' must be SD_SCHEDULED, SD_RUNNABLE or SD_IN_FIFO",
1022 SD_task_get_name(task));
1024 xbt_free(task->computation_amount);
1025 xbt_free(task->communication_amount);
1026 task->computation_amount = task->communication_amount = NULL;
1029 /* Runs a task. This function is directly called by __SD_task_try_to_run if
1030 * the task doesn't have to wait in FIFOs. Otherwise, it is called by
1031 * __SD_task_just_done when the task gets out of its FIFOs.
1033 void __SD_task_really_run(SD_task_t task)
1037 void **surf_workstations;
1039 xbt_assert(__SD_task_is_runnable_or_in_fifo(task),
1040 "Task '%s' is not runnable or in a fifo! Task state: %d",
1041 SD_task_get_name(task), (int)SD_task_get_state(task));
1042 xbt_assert(task->workstation_list != NULL,
1043 "Task '%s': workstation_list is NULL!",
1044 SD_task_get_name(task));
1046 XBT_DEBUG("Really running task '%s'", SD_task_get_name(task));
1047 int workstation_nb = task->workstation_nb;
1049 /* set this task as current task for the workstations in sequential mode */
1050 for (i = 0; i < workstation_nb; i++) {
1051 if (SD_workstation_get_access_mode(task->workstation_list[i]) ==
1052 SD_WORKSTATION_SEQUENTIAL_ACCESS) {
1053 SD_workstation_priv(task->workstation_list[i])->current_task = task;
1054 xbt_assert(__SD_workstation_is_busy(task->workstation_list[i]),
1055 "The workstation should be busy now");
1059 XBT_DEBUG("Task '%s' set as current task for its workstations",
1060 SD_task_get_name(task));
1062 /* start the task */
1064 /* we have to create a Surf workstation array instead of the SimDag
1065 * workstation array */
1066 surf_workstations = xbt_new(void *, workstation_nb);
1068 for (i = 0; i < workstation_nb; i++)
1069 surf_workstations[i] = task->workstation_list[i];
1071 double *computation_amount = xbt_new0(double, workstation_nb);
1072 double *communication_amount = xbt_new0(double, workstation_nb * workstation_nb);
1075 if(task->computation_amount)
1076 memcpy(computation_amount, task->computation_amount, sizeof(double) *
1078 if(task->communication_amount)
1079 memcpy(communication_amount, task->communication_amount,
1080 sizeof(double) * workstation_nb * workstation_nb);
1083 surf_workstation_model->extension.
1084 workstation.execute_parallel_task(workstation_nb,
1087 communication_amount,
1090 surf_workstation_model->action_data_set(task->surf_action, task);
1092 XBT_DEBUG("surf_action = %p", task->surf_action);
1096 TRACE_surf_action(task->surf_action, task->category);
1099 __SD_task_destroy_scheduling_data(task); /* now the scheduling data are not useful anymore */
1100 __SD_task_set_state(task, SD_RUNNING);
1101 xbt_assert(__SD_task_is_running(task), "Bad state of task '%s': %d",
1102 SD_task_get_name(task), (int)SD_task_get_state(task));
1106 /* Tries to run a task. This function is called by SD_simulate() when a
1107 * scheduled task becomes SD_RUNNABLE (i.e., when its dependencies are
1109 * If one of the workstations where the task is scheduled on is busy (in
1110 * sequential mode), the task doesn't start.
1111 * Returns whether the task has started.
1113 int __SD_task_try_to_run(SD_task_t task)
1118 SD_workstation_t workstation;
1120 xbt_assert(__SD_task_is_runnable(task),
1121 "Task '%s' is not runnable! Task state: %d",
1122 SD_task_get_name(task), (int)SD_task_get_state(task));
1125 for (i = 0; i < task->workstation_nb; i++) {
1126 can_start = can_start &&
1127 !__SD_workstation_is_busy(task->workstation_list[i]);
1130 XBT_DEBUG("Task '%s' can start: %d", SD_task_get_name(task), can_start);
1132 if (!can_start) { /* if the task cannot start and is not in the FIFOs yet */
1133 for (i = 0; i < task->workstation_nb; i++) {
1134 workstation = task->workstation_list[i];
1135 if (SD_workstation_priv(workstation)->access_mode == SD_WORKSTATION_SEQUENTIAL_ACCESS) {
1136 XBT_DEBUG("Pushing task '%s' in the FIFO of workstation '%s'",
1137 SD_task_get_name(task),
1138 SD_workstation_get_name(workstation));
1139 xbt_fifo_push(SD_workstation_priv(workstation)->task_fifo, task);
1142 __SD_task_set_state(task, SD_IN_FIFO);
1143 xbt_assert(__SD_task_is_in_fifo(task), "Bad state of task '%s': %d",
1144 SD_task_get_name(task), (int)SD_task_get_state(task));
1145 XBT_DEBUG("Task '%s' state is now SD_IN_FIFO", SD_task_get_name(task));
1147 __SD_task_really_run(task);
1153 /* This function is called by SD_simulate when a task is done.
1154 * It updates task->state and task->action and executes if necessary the tasks
1155 * which were waiting in FIFOs for the end of `task'
1157 void __SD_task_just_done(SD_task_t task)
1160 SD_workstation_t workstation;
1162 SD_task_t candidate;
1163 int candidate_nb = 0;
1164 int candidate_capacity = 8;
1165 SD_task_t *candidates;
1168 xbt_assert(__SD_task_is_running(task),
1169 "The task must be running! Task state: %d",
1170 (int)SD_task_get_state(task));
1171 xbt_assert(task->workstation_list != NULL,
1172 "Task '%s': workstation_list is NULL!",
1173 SD_task_get_name(task));
1176 candidates = xbt_new(SD_task_t, 8);
1178 __SD_task_set_state(task, SD_DONE);
1179 surf_workstation_model->action_unref(task->surf_action);
1180 task->surf_action = NULL;
1182 XBT_DEBUG("Looking for candidates");
1184 /* if the task was executed on sequential workstations,
1185 maybe we can execute the next task of the FIFO for each workstation */
1186 for (i = 0; i < task->workstation_nb; i++) {
1187 workstation = task->workstation_list[i];
1188 XBT_DEBUG("Workstation '%s': access_mode = %d",
1189 SD_workstation_get_name(workstation), (int)SD_workstation_priv(workstation)->access_mode);
1190 if (SD_workstation_priv(workstation)->access_mode == SD_WORKSTATION_SEQUENTIAL_ACCESS) {
1191 xbt_assert(SD_workstation_priv(workstation)->task_fifo != NULL,
1192 "Workstation '%s' has sequential access but no FIFO!",
1193 SD_workstation_get_name(workstation));
1194 xbt_assert(SD_workstation_priv(workstation)->current_task =
1195 task, "Workstation '%s': current task should be '%s'",
1196 SD_workstation_get_name(workstation),
1197 SD_task_get_name(task));
1199 /* the task is over so we can release the workstation */
1200 SD_workstation_priv(workstation)->current_task = NULL;
1202 XBT_DEBUG("Getting candidate in FIFO");
1204 xbt_fifo_get_item_content(xbt_fifo_get_first_item
1205 (SD_workstation_priv(workstation)->task_fifo));
1207 if (candidate != NULL) {
1208 XBT_DEBUG("Candidate: '%s'", SD_task_get_name(candidate));
1209 xbt_assert(__SD_task_is_in_fifo(candidate),
1210 "Bad state of candidate '%s': %d",
1211 SD_task_get_name(candidate),
1212 (int)SD_task_get_state(candidate));
1215 XBT_DEBUG("Candidate in fifo: %p", candidate);
1217 /* if there was a task waiting for my place */
1218 if (candidate != NULL) {
1219 /* Unfortunately, we are not sure yet that we can execute the task now,
1220 because the task can be waiting more deeply in some other
1221 workstation's FIFOs ...
1222 So we memorize all candidate tasks, and then we will check for each
1223 candidate whether or not all its workstations are available. */
1225 /* realloc if necessary */
1226 if (candidate_nb == candidate_capacity) {
1227 candidate_capacity *= 2;
1229 xbt_realloc(candidates,
1230 sizeof(SD_task_t) * candidate_capacity);
1233 /* register the candidate */
1234 candidates[candidate_nb++] = candidate;
1235 candidate->fifo_checked = 0;
1240 XBT_DEBUG("Candidates found: %d", candidate_nb);
1242 /* now we check every candidate task */
1243 for (i = 0; i < candidate_nb; i++) {
1244 candidate = candidates[i];
1246 if (candidate->fifo_checked) {
1247 continue; /* we have already evaluated that task */
1250 xbt_assert(__SD_task_is_in_fifo(candidate),
1251 "Bad state of candidate '%s': %d",
1252 SD_task_get_name(candidate), (int)SD_task_get_state(candidate));
1254 for (j = 0; j < candidate->workstation_nb && can_start; j++) {
1255 workstation = candidate->workstation_list[j];
1257 /* I can start on this workstation if the workstation is shared
1258 or if I am the first task in the FIFO */
1259 can_start = SD_workstation_priv(workstation)->access_mode == SD_WORKSTATION_SHARED_ACCESS
1261 xbt_fifo_get_item_content(xbt_fifo_get_first_item
1262 (SD_workstation_priv(workstation)->task_fifo));
1265 XBT_DEBUG("Candidate '%s' can start: %d", SD_task_get_name(candidate),
1268 /* now we are sure that I can start! */
1270 for (j = 0; j < candidate->workstation_nb && can_start; j++) {
1271 workstation = candidate->workstation_list[j];
1273 /* update the FIFO */
1274 if (SD_workstation_priv(workstation)->access_mode == SD_WORKSTATION_SEQUENTIAL_ACCESS) {
1275 candidate = xbt_fifo_shift(SD_workstation_priv(workstation)->task_fifo); /* the return value is stored just for debugging */
1276 XBT_DEBUG("Head of the FIFO: '%s'",
1278 NULL) ? SD_task_get_name(candidate) : "NULL");
1279 xbt_assert(candidate == candidates[i],
1280 "Error in __SD_task_just_done: bad first task in the FIFO");
1282 } /* for each workstation */
1284 /* finally execute the task */
1285 XBT_DEBUG("Task '%s' state: %d", SD_task_get_name(candidate),
1286 (int)SD_task_get_state(candidate));
1287 __SD_task_really_run(candidate);
1290 ("Calling __SD_task_is_running: task '%s', state set: %p, running_task_set: %p, is running: %d",
1291 SD_task_get_name(candidate), candidate->state_set,
1292 sd_global->running_task_set, __SD_task_is_running(candidate));
1293 xbt_assert(__SD_task_is_running(candidate),
1294 "Bad state of task '%s': %d",
1295 SD_task_get_name(candidate),
1296 (int)SD_task_get_state(candidate));
1297 XBT_DEBUG("Okay, the task is running.");
1300 candidate->fifo_checked = 1;
1301 } /* for each candidate */
1303 xbt_free(candidates);
1307 * Remove all dependencies associated with a task. This function is called
1308 * when the task is destroyed.
1310 static void __SD_task_remove_dependencies(SD_task_t task)
1312 /* we must destroy the dependencies carefuly (with SD_dependency_remove)
1313 because each one is stored twice */
1314 SD_dependency_t dependency;
1315 while (!xbt_dynar_is_empty(task->tasks_before)) {
1316 xbt_dynar_get_cpy(task->tasks_before, 0, &dependency);
1317 SD_task_dependency_remove(dependency->src, dependency->dst);
1320 while (!xbt_dynar_is_empty(task->tasks_after)) {
1321 xbt_dynar_get_cpy(task->tasks_after, 0, &dependency);
1322 SD_task_dependency_remove(dependency->src, dependency->dst);
1327 * \brief Returns the start time of a task
1329 * The task state must be SD_RUNNING, SD_DONE or SD_FAILED.
1331 * \param task: a task
1332 * \return the start time of this task
1334 double SD_task_get_start_time(SD_task_t task)
1336 if (task->surf_action)
1337 return surf_workstation_model->
1338 action_get_start_time(task->surf_action);
1340 return task->start_time;
1344 * \brief Returns the finish time of a task
1346 * The task state must be SD_RUNNING, SD_DONE or SD_FAILED.
1347 * If the state is not completed yet, the returned value is an
1348 * estimation of the task finish time. This value can fluctuate
1349 * until the task is completed.
1351 * \param task: a task
1352 * \return the start time of this task
1354 double SD_task_get_finish_time(SD_task_t task)
1356 if (task->surf_action) /* should never happen as actions are destroyed right after their completion */
1357 return surf_workstation_model->
1358 action_get_finish_time(task->surf_action);
1360 return task->finish_time;
1365 void SD_task_distribute_comp_amdhal(SD_task_t task, int ws_count)
1368 xbt_assert(task->kind == SD_TASK_COMP_PAR_AMDAHL,
1369 "Task %s is not a SD_TASK_COMP_PAR_AMDAHL typed task."
1370 "Cannot use this function.",
1371 SD_task_get_name(task));
1373 task->computation_amount = xbt_new0(double, ws_count);
1374 task->communication_amount = xbt_new0(double, ws_count * ws_count);
1375 task->workstation_nb = ws_count;
1376 task->workstation_list = xbt_new0(SD_workstation_t, ws_count);
1378 for(i=0;i<ws_count;i++){
1379 task->computation_amount[i] =
1380 (task->alpha + (1 - task->alpha)/ws_count) * task->amount;
1385 /** @brief Auto-schedules a task.
1387 * Auto-scheduling mean that the task can be used with SD_task_schedulev(). This
1388 * allows to specify the task costs at creation, and decouple them from the
1389 * scheduling process where you just specify which resource should deliver the
1392 * To be auto-schedulable, a task must be created with SD_task_create_comm_e2e()
1393 * or SD_task_create_comp_seq(). Check their definitions for the exact semantic
1397 * We should create tasks kind for the following categories:
1398 * - Point to point communication (done)
1399 * - Sequential computation (done)
1400 * - group communication (redistribution, several kinds)
1401 * - parallel tasks with no internal communication (one kind per speedup
1402 * model such as Amdahl)
1403 * - idem+ internal communication. Task type not enough since we cannot store
1404 * comm cost alongside to comp one)
1406 void SD_task_schedulev(SD_task_t task, int count,
1407 const SD_workstation_t * list)
1410 SD_dependency_t dep;
1412 xbt_assert(task->kind != 0,
1413 "Task %s is not typed. Cannot automatically schedule it.",
1414 SD_task_get_name(task));
1415 switch (task->kind) {
1416 case SD_TASK_COMP_PAR_AMDAHL:
1417 SD_task_distribute_comp_amdhal(task, count);
1418 case SD_TASK_COMM_E2E:
1419 case SD_TASK_COMP_SEQ:
1420 xbt_assert(task->workstation_nb == count,
1421 "Got %d locations, but were expecting %d locations",
1422 count,task->workstation_nb);
1423 for (i = 0; i < count; i++)
1424 task->workstation_list[i] = list[i];
1425 if (SD_task_get_kind(task)== SD_TASK_COMP_SEQ && !task->computation_amount){
1426 /*This task has failed and is rescheduled. Reset the computation amount*/
1427 task->computation_amount = xbt_new0(double, 1);
1428 task->computation_amount[0] = task->remains;
1430 SD_task_do_schedule(task);
1433 xbt_die("Kind of task %s not supported by SD_task_schedulev()",
1434 SD_task_get_name(task));
1436 if (task->kind == SD_TASK_COMM_E2E) {
1437 XBT_VERB("Schedule comm task %s between %s -> %s. It costs %.f bytes",
1438 SD_task_get_name(task),
1439 SD_workstation_get_name(task->workstation_list[0]),
1440 SD_workstation_get_name(task->workstation_list[1]),
1441 task->communication_amount[2]);
1445 /* Iterate over all children and parents being COMM_E2E to say where I am
1446 * located (and start them if runnable) */
1447 if (task->kind == SD_TASK_COMP_SEQ) {
1448 XBT_VERB("Schedule computation task %s on %s. It costs %.f flops",
1449 SD_task_get_name(task),
1450 SD_workstation_get_name(task->workstation_list[0]),
1451 task->computation_amount[0]);
1453 xbt_dynar_foreach(task->tasks_before, cpt, dep) {
1454 SD_task_t before = dep->src;
1455 if (before->kind == SD_TASK_COMM_E2E) {
1456 before->workstation_list[1] = task->workstation_list[0];
1458 if (before->workstation_list[0] &&
1459 (__SD_task_is_schedulable(before)
1460 || __SD_task_is_not_scheduled(before))) {
1461 SD_task_do_schedule(before);
1463 ("Auto-Schedule comm task %s between %s -> %s. It costs %.f bytes",
1464 SD_task_get_name(before),
1465 SD_workstation_get_name(before->workstation_list[0]),
1466 SD_workstation_get_name(before->workstation_list[1]),
1467 before->communication_amount[2]);
1471 xbt_dynar_foreach(task->tasks_after, cpt, dep) {
1472 SD_task_t after = dep->dst;
1473 if (after->kind == SD_TASK_COMM_E2E) {
1474 after->workstation_list[0] = task->workstation_list[0];
1475 if (after->workstation_list[1]
1476 && (__SD_task_is_not_scheduled(after)
1477 || __SD_task_is_schedulable(after))) {
1478 SD_task_do_schedule(after);
1480 ("Auto-Schedule comm task %s between %s -> %s. It costs %.f bytes",
1481 SD_task_get_name(after),
1482 SD_workstation_get_name(after->workstation_list[0]),
1483 SD_workstation_get_name(after->workstation_list[1]),
1484 after->communication_amount[2]);
1490 /* Iterate over all children and parents being MXN_1D_BLOCK to say where I am
1491 * located (and start them if runnable) */
1492 if (task->kind == SD_TASK_COMP_PAR_AMDAHL) {
1493 XBT_VERB("Schedule computation task %s on %d workstations. %.f flops"
1494 " will be distributed following Amdahl'Law",
1495 SD_task_get_name(task), task->workstation_nb,
1496 task->computation_amount[0]);
1497 xbt_dynar_foreach(task->tasks_before, cpt, dep) {
1498 SD_task_t before = dep->src;
1499 if (before->kind == SD_TASK_COMM_PAR_MXN_1D_BLOCK){
1500 if (!before->workstation_list){
1501 XBT_VERB("Sender side of Task %s is not scheduled yet",
1502 SD_task_get_name(before));
1503 before->workstation_list = xbt_new0(SD_workstation_t, count);
1504 before->workstation_nb = count;
1505 XBT_VERB("Fill the workstation list with list of Task '%s'",
1506 SD_task_get_name(task));
1507 for (i=0;i<count;i++)
1508 before->workstation_list[i] = task->workstation_list[i];
1510 XBT_VERB("Build communication matrix for task '%s'",
1511 SD_task_get_name(before));
1513 double src_start, src_end, dst_start, dst_end;
1514 src_nb = before->workstation_nb;
1516 before->workstation_list = (SD_workstation_t*) xbt_realloc(
1517 before->workstation_list,
1518 (before->workstation_nb+count)*sizeof(s_SD_workstation_t));
1519 for(i=0; i<count; i++)
1520 before->workstation_list[before->workstation_nb+i] =
1521 task->workstation_list[i];
1523 before->workstation_nb += count;
1525 before->computation_amount = xbt_new0(double,
1526 before->workstation_nb);
1527 before->communication_amount = xbt_new0(double,
1528 before->workstation_nb*
1529 before->workstation_nb);
1531 for(i=0;i<src_nb;i++){
1532 src_start = i*before->amount/src_nb;
1533 src_end = src_start + before->amount/src_nb;
1534 for(j=0; j<dst_nb; j++){
1535 dst_start = j*before->amount/dst_nb;
1536 dst_end = dst_start + before->amount/dst_nb;
1537 XBT_VERB("(%s->%s): (%.2f, %.2f)-> (%.2f, %.2f)",
1538 SD_workstation_get_name(before->workstation_list[i]),
1539 SD_workstation_get_name(before->workstation_list[src_nb+j]),
1540 src_start, src_end, dst_start, dst_end);
1541 if ((src_end <= dst_start) || (dst_end <= src_start)) {
1542 before->communication_amount[i*(src_nb+dst_nb)+src_nb+j]=0.0;
1544 before->communication_amount[i*(src_nb+dst_nb)+src_nb+j] =
1545 MIN(src_end, dst_end) - MAX(src_start, dst_start);
1547 XBT_VERB("==> %.2f",
1548 before->communication_amount[i*(src_nb+dst_nb)+src_nb+j]);
1552 if (__SD_task_is_schedulable(before) ||
1553 __SD_task_is_not_scheduled(before)) {
1554 SD_task_do_schedule(before);
1556 ("Auto-Schedule redistribution task %s. Send %.f bytes from %d hosts to %d hosts.",
1557 SD_task_get_name(before),before->amount, src_nb, dst_nb);
1562 xbt_dynar_foreach(task->tasks_after, cpt, dep) {
1563 SD_task_t after = dep->dst;
1564 if (after->kind == SD_TASK_COMM_PAR_MXN_1D_BLOCK){
1565 if (!after->workstation_list){
1566 XBT_VERB("Receiver side of Task '%s' is not scheduled yet",
1567 SD_task_get_name(after));
1568 after->workstation_list = xbt_new0(SD_workstation_t, count);
1569 after->workstation_nb = count;
1570 XBT_VERB("Fill the workstation list with list of Task '%s'",
1571 SD_task_get_name(task));
1572 for (i=0;i<count;i++)
1573 after->workstation_list[i] = task->workstation_list[i];
1576 double src_start, src_end, dst_start, dst_end;
1578 dst_nb = after->workstation_nb;
1579 after->workstation_list = (SD_workstation_t*) xbt_realloc(
1580 after->workstation_list,
1581 (after->workstation_nb+count)*sizeof(s_SD_workstation_t));
1582 for(i=after->workstation_nb - 1; i>=0; i--)
1583 after->workstation_list[count+i] = after->workstation_list[i];
1584 for(i=0; i<count; i++)
1585 after->workstation_list[i] = task->workstation_list[i];
1587 after->workstation_nb += count;
1589 after->computation_amount = xbt_new0(double, after->workstation_nb);
1590 after->communication_amount = xbt_new0(double,
1591 after->workstation_nb*
1592 after->workstation_nb);
1594 for(i=0;i<src_nb;i++){
1595 src_start = i*after->amount/src_nb;
1596 src_end = src_start + after->amount/src_nb;
1597 for(j=0; j<dst_nb; j++){
1598 dst_start = j*after->amount/dst_nb;
1599 dst_end = dst_start + after->amount/dst_nb;
1600 XBT_VERB("(%d->%d): (%.2f, %.2f)-> (%.2f, %.2f)",
1601 i, j, src_start, src_end, dst_start, dst_end);
1602 if ((src_end <= dst_start) || (dst_end <= src_start)) {
1603 after->communication_amount[i*(src_nb+dst_nb)+src_nb+j]=0.0;
1605 after->communication_amount[i*(src_nb+dst_nb)+src_nb+j] =
1606 MIN(src_end, dst_end)- MAX(src_start, dst_start);
1608 XBT_VERB("==> %.2f",
1609 after->communication_amount[i*(src_nb+dst_nb)+src_nb+j]);
1613 if (__SD_task_is_schedulable(after) ||
1614 __SD_task_is_not_scheduled(after)) {
1615 SD_task_do_schedule(after);
1617 ("Auto-Schedule redistribution task %s. Send %.f bytes from %d hosts to %d hosts.",
1618 SD_task_get_name(after),after->amount, src_nb, dst_nb);
1626 /** @brief autoschedule a task on a list of workstations
1628 * This function is very similar to SD_task_schedulev(),
1629 * but takes the list of workstations to schedule onto as separate parameters.
1630 * It builds a proper vector of workstations and then call SD_task_schedulev()
1632 void SD_task_schedulel(SD_task_t task, int count, ...)
1635 SD_workstation_t *list = xbt_new(SD_workstation_t, count);
1637 va_start(ap, count);
1638 for (i = 0; i < count; i++) {
1639 list[i] = va_arg(ap, SD_workstation_t);
1642 SD_task_schedulev(task, count, list);
1647 * \brief Sets the tracing category of a task.
1649 * This function should be called after the creation of a
1650 * SimDAG task, to define the category of that task. The first
1651 * parameter must contain a task that was created with the
1652 * function #SD_task_create. The second parameter must contain
1653 * a category that was previously declared with the function
1656 * \param task The task to be considered
1657 * \param category the name of the category to be associated to the task
1659 * \see SD_task_get_category, TRACE_category, TRACE_category_with_color
1661 void SD_task_set_category (SD_task_t task, const char *category)
1664 if (!TRACE_is_enabled()) return;
1665 if (task == NULL) return;
1666 if (category == NULL){
1667 if (task->category) xbt_free (task->category);
1668 task->category = NULL;
1670 task->category = xbt_strdup (category);
1676 * \brief Gets the current tracing category of a task.
1678 * \param task The task to be considered
1680 * \see SD_task_set_category
1682 * \return Returns the name of the tracing category of the given task, NULL otherwise
1684 const char *SD_task_get_category (SD_task_t task)
1687 return task->category;