X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/4896f3c8a8954bb760d9654784f9c13460c8f476..90a471de6cd70b41223dd16a09fafe6ac3e18269:/src/simdag/sd_task.cpp diff --git a/src/simdag/sd_task.cpp b/src/simdag/sd_task.cpp index a9cae7e157..0006c32779 100644 --- a/src/simdag/sd_task.cpp +++ b/src/simdag/sd_task.cpp @@ -4,11 +4,9 @@ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ +#include "simdag_private.hpp" #include "src/surf/HostImpl.hpp" #include "src/surf/surf_interface.hpp" -#include "src/simdag/simdag_private.h" -#include "simgrid/simdag.h" -#include "src/instr/instr_private.h" XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_task, sd, "Logging specific to SimDag (task)"); @@ -20,61 +18,8 @@ static void __SD_task_destroy_scheduling_data(SD_task_t task) xbt_free(task->flops_amount); xbt_free(task->bytes_amount); - task->flops_amount = nullptr; task->bytes_amount = nullptr; -} - -void* SD_task_new_f() -{ - SD_task_t task = xbt_new0(s_SD_task_t, 1); - - task->inputs = new std::set(); - task->outputs = new std::set(); - task->predecessors = new std::set(); - task->successors = new std::set(); - return task; -} - -void SD_task_recycle_f(void *t) -{ - SD_task_t task = static_cast(t); - - /* Reset the content */ - task->kind = SD_TASK_NOT_TYPED; - task->state= SD_NOT_SCHEDULED; - sd_global->initial_tasks->insert(task); - - task->marked = 0; - - task->start_time = -1.0; - task->finish_time = -1.0; - task->surf_action = nullptr; - task->watch_points = 0; - - /* dependencies */ - task->inputs->clear(); - task->outputs->clear(); - task->predecessors->clear(); - task->successors->clear(); - - /* scheduling parameters */ - task->host_count = 0; - task->host_list = nullptr; task->flops_amount = nullptr; - task->bytes_amount = nullptr; - task->rate = -1; -} - -void SD_task_free_f(void *t) -{ - SD_task_t task = static_cast(t); - - delete task->inputs; - delete task->outputs; - delete task->predecessors; - delete task->successors; - - xbt_free(task); } /** @@ -88,23 +33,35 @@ void SD_task_free_f(void *t) */ SD_task_t SD_task_create(const char *name, void *data, double amount) { - SD_task_t task = static_cast(xbt_mallocator_get(sd_global->task_mallocator)); + SD_task_t task = xbt_new0(s_SD_task_t, 1); + task->kind = SD_TASK_NOT_TYPED; + task->state= SD_NOT_SCHEDULED; + sd_global->initial_tasks->insert(task); + + task->marked = 0; + task->start_time = -1.0; + task->finish_time = -1.0; + task->surf_action = nullptr; + task->watch_points = 0; + + task->inputs = new std::set(); + task->outputs = new std::set(); + task->predecessors = new std::set(); + task->successors = new std::set(); task->data = data; task->name = xbt_strdup(name); task->amount = amount; - task->remains = amount; - + task->allocation = new std::vector(); + task->rate = -1; return task; } -static inline SD_task_t SD_task_create_sized(const char *name, void *data, double amount, int ws_count) +static inline SD_task_t SD_task_create_sized(const char *name, void *data, double amount, int count) { SD_task_t task = SD_task_create(name, data, amount); - task->bytes_amount = xbt_new0(double, ws_count * ws_count); - task->flops_amount = xbt_new0(double, ws_count); - task->host_count = ws_count; - task->host_list = xbt_new0(sg_host_t, ws_count); + task->bytes_amount = xbt_new0(double, count * count); + task->flops_amount = xbt_new0(double, count); return task; } @@ -191,7 +148,6 @@ SD_task_t SD_task_create_comp_par_amdahl(const char *name, void *data, double fl SD_task_t SD_task_create_comm_par_mxn_1d_block(const char *name, void *data, double amount) { SD_task_t res = SD_task_create(name, data, amount); - res->host_list=nullptr; res->kind = SD_TASK_COMM_PAR_MXN_1D_BLOCK; return res; @@ -222,21 +178,19 @@ void SD_task_destroy(SD_task_t task) if (task->state == SD_SCHEDULED || task->state == SD_RUNNABLE) __SD_task_destroy_scheduling_data(task); - int idx = xbt_dynar_search_or_negative(sd_global->return_set, &task); - if (idx >=0) { - xbt_dynar_remove_at(sd_global->return_set, idx, nullptr); - } - xbt_free(task->name); if (task->surf_action != nullptr) task->surf_action->unref(); - xbt_free(task->host_list); + delete task->allocation; xbt_free(task->bytes_amount); xbt_free(task->flops_amount); - - xbt_mallocator_release(sd_global->task_mallocator,task); + delete task->inputs; + delete task->outputs; + delete task->predecessors; + delete task->successors; + xbt_free(task); XBT_DEBUG("Task destroyed."); } @@ -256,8 +210,7 @@ void *SD_task_get_data(SD_task_t task) /** * \brief Sets the user data of a task * - * The new data can be \c nullptr. The old data should have been freed first - * if it was not \c nullptr. + * The new data can be \c nullptr. The old data should have been freed first, if it was not \c nullptr. * * \param task a task * \param data the new data you want to associate with this task @@ -336,7 +289,6 @@ void SD_task_set_state(SD_task_t task, e_SD_task_state_t new_state) task->start_time = task->surf_action->getStartTime(); if (new_state == SD_DONE){ task->finish_time = task->surf_action->getFinishTime(); - task->remains = 0; #if HAVE_JEDULE jedule_log_sd_event(task); #endif @@ -344,12 +296,13 @@ void SD_task_set_state(SD_task_t task, e_SD_task_state_t new_state) task->finish_time = surf_get_clock(); task->surf_action->unref(); task->surf_action = nullptr; + task->allocation->clear(); } task->state = new_state; if (task->watch_points & new_state) { - XBT_VERB("Watch point reached with task '%s'!", SD_task_get_name(task)); + XBT_VERB("Watch point reached with task '%s'!", task->name); sd_global->watch_point_reached = true; SD_task_unwatch(task, new_state); /* remove the watch point */ } @@ -416,7 +369,7 @@ xbt_dynar_t SD_task_get_children(SD_task_t task) */ int SD_task_get_workstation_count(SD_task_t task) { - return task->host_count; + return task->allocation->size(); } /** @@ -427,7 +380,7 @@ int SD_task_get_workstation_count(SD_task_t task) */ sg_host_t *SD_task_get_workstation_list(SD_task_t task) { - return task->host_list; + return &(*(task->allocation))[0]; } /** @@ -483,7 +436,7 @@ double SD_task_get_remaining_amount(SD_task_t task) if (task->surf_action) return task->surf_action->getRemains(); else - return task->remains; + return (task->state == SD_DONE) ? 0 : task->amount; } e_SD_task_kind_t SD_task_get_kind(SD_task_t task) @@ -495,16 +448,12 @@ e_SD_task_kind_t SD_task_get_kind(SD_task_t task) void SD_task_dump(SD_task_t task) { XBT_INFO("Displaying task %s", SD_task_get_name(task)); - char *statename = bprintf("%s%s%s%s%s%s%s", - (task->state == SD_NOT_SCHEDULED ? " not scheduled" : ""), - (task->state == SD_SCHEDULABLE ? " schedulable" : ""), - (task->state == SD_SCHEDULED ? " scheduled" : ""), - (task->state == SD_RUNNABLE ? " runnable" : " not runnable"), - (task->state == SD_RUNNING ? " running" : ""), - (task->state == SD_DONE ? " done" : ""), - (task->state == SD_FAILED ? " failed" : "")); - XBT_INFO(" - state:%s", statename); - free(statename); + if (task->state == SD_RUNNABLE) + XBT_INFO(" - state: runnable"); + else if (task->state < SD_RUNNABLE) + XBT_INFO(" - state: %s not runnable", __get_state_name(task->state)); + else + XBT_INFO(" - state: not runnable %s", __get_state_name(task->state)); if (task->kind != 0) { switch (task->kind) { @@ -532,18 +481,18 @@ void SD_task_dump(SD_task_t task) if ((task->inputs->size()+ task->predecessors->size()) > 0) { XBT_INFO(" - pre-dependencies:"); for (auto it : *task->predecessors) - XBT_INFO(" %s", SD_task_get_name(it)); + XBT_INFO(" %s", it->name); for (auto it: *task->inputs) - XBT_INFO(" %s", SD_task_get_name(it)); + XBT_INFO(" %s", it->name); } if ((task->outputs->size() + task->successors->size()) > 0) { XBT_INFO(" - post-dependencies:"); for (auto it : *task->successors) - XBT_INFO(" %s", SD_task_get_name(it)); + XBT_INFO(" %s", it->name); for (auto it : *task->outputs) - XBT_INFO(" %s", SD_task_get_name(it)); + XBT_INFO(" %s", it->name); } } @@ -778,9 +727,8 @@ static inline void SD_task_do_schedule(SD_task_t task) void SD_task_schedule(SD_task_t task, int host_count, const sg_host_t * host_list, const double *flops_amount, const double *bytes_amount, double rate) { - xbt_assert(host_count > 0, "workstation_nb must be positive"); + xbt_assert(host_count > 0, "host_count must be positive"); - task->host_count = host_count; task->rate = rate; if (flops_amount) { @@ -800,8 +748,8 @@ void SD_task_schedule(SD_task_t task, int host_count, const sg_host_t * host_lis task->bytes_amount = nullptr; } - task->host_list = static_cast(xbt_realloc(task->host_list, sizeof(sg_host_t) * host_count)); - memcpy(task->host_list, host_list, sizeof(sg_host_t) * host_count); + for(int i =0; iallocation->push_back(host_list[i]); SD_task_do_schedule(task); } @@ -825,9 +773,7 @@ void SD_task_unschedule(SD_task_t task) && ((task->kind == SD_TASK_COMP_PAR_AMDAHL) || (task->kind == SD_TASK_COMM_PAR_MXN_1D_BLOCK))) { /* Don't free scheduling data for typed tasks */ __SD_task_destroy_scheduling_data(task); - xbt_free(task->host_list); - task->host_list=nullptr; - task->host_count = 0; + task->allocation->clear(); } if (SD_task_get_state(task) == SD_RUNNING) @@ -839,7 +785,6 @@ void SD_task_unschedule(SD_task_t task) else SD_task_set_state(task, SD_NOT_SCHEDULED); } - task->remains = task->amount; task->start_time = -1.0; } @@ -847,16 +792,18 @@ void SD_task_unschedule(SD_task_t task) void SD_task_run(SD_task_t task) { xbt_assert(task->state == SD_RUNNABLE, "Task '%s' is not runnable! Task state: %d", task->name, (int) task->state); - xbt_assert(task->host_list != nullptr, "Task '%s': workstation_list is nullptr!", task->name); + xbt_assert(task->allocation != nullptr, "Task '%s': host_list is nullptr!", task->name); XBT_VERB("Executing task '%s'", task->name); /* Copy the elements of the task into the action */ - int host_nb = task->host_count; + int host_nb = task->allocation->size(); sg_host_t *hosts = xbt_new(sg_host_t, host_nb); - - for (int i = 0; i < host_nb; i++) - hosts[i] = task->host_list[i]; + int i =0; + for (auto host: *task->allocation){ + hosts[i] = host; + i++; + } double *flops_amount = xbt_new0(double, host_nb); double *bytes_amount = xbt_new0(double, host_nb * host_nb); @@ -874,7 +821,7 @@ void SD_task_run(SD_task_t task) __SD_task_destroy_scheduling_data(task); /* now the scheduling data are not useful anymore */ SD_task_set_state(task, SD_RUNNING); - xbt_dynar_push(sd_global->return_set, &task); + sd_global->return_set->insert(task); } /** @@ -911,18 +858,37 @@ double SD_task_get_finish_time(SD_task_t task) return task->finish_time; } -void SD_task_distribute_comp_amdahl(SD_task_t task, int ws_count) +void SD_task_distribute_comp_amdahl(SD_task_t task, int count) { xbt_assert(task->kind == SD_TASK_COMP_PAR_AMDAHL, "Task %s is not a SD_TASK_COMP_PAR_AMDAHL typed task." "Cannot use this function.", task->name); - task->flops_amount = xbt_new0(double, ws_count); - task->bytes_amount = xbt_new0(double, ws_count * ws_count); - xbt_free(task->host_list); - task->host_count = ws_count; - task->host_list = xbt_new0(sg_host_t, ws_count); - - for (int i=0; iflops_amount[i] = (task->alpha + (1 - task->alpha)/ws_count) * task->amount; + task->flops_amount = xbt_new0(double, count); + task->bytes_amount = xbt_new0(double, count * count); + + for (int i=0; iflops_amount[i] = (task->alpha + (1 - task->alpha)/count) * task->amount; + } +} + +void SD_task_build_MxN_1D_block_matrix(SD_task_t task, int src_nb, int dst_nb){ + xbt_assert(task->kind == SD_TASK_COMM_PAR_MXN_1D_BLOCK, "Task %s is not a SD_TASK_COMM_PAR_MXN_1D_BLOCK typed task." + "Cannot use this function.", task->name); + xbt_free(task->bytes_amount); + task->bytes_amount = xbt_new0(double,task->allocation->size() * task->allocation->size()); + + for (int i=0; iamount/src_nb; + double src_end = src_start + task->amount/src_nb; + for (int j=0; jamount/dst_nb; + double dst_end = dst_start + task->amount/dst_nb; + XBT_VERB("(%d->%d): (%.2f, %.2f)-> (%.2f, %.2f)", i, j, src_start, src_end, dst_start, dst_end); + task->bytes_amount[i*(src_nb+dst_nb)+src_nb+j]=0.0; + if ((src_end > dst_start) && (dst_end > src_start)) { /* There is something to send */ + task->bytes_amount[i*(src_nb+dst_nb)+src_nb+j] = MIN(src_end, dst_end)- MAX(src_start, dst_start); + XBT_VERB("==> %.2f", task->bytes_amount[i*(src_nb+dst_nb)+src_nb+j]); + } + } } } @@ -932,189 +898,87 @@ void SD_task_distribute_comp_amdahl(SD_task_t task, int ws_count) * creation, and decouple them from the scheduling process where you just specify which resource should deliver the * mandatory power. * - * To be auto-schedulable, a task must be type and created with one of the specialized creation functions. - * - * @todo - * We should create tasks kind for the following categories: - * - Point to point communication (done) - * - Sequential computation (done) - * - group communication (redistribution, several kinds) - * - parallel tasks with no internal communication (one kind per speedup model such as Amdahl) - * - idem+ internal communication. Task type not enough since we cannot store comm cost alongside to comp one) + * To be auto-schedulable, a task must be a typed computation SD_TASK_COMP_SEQ or SD_TASK_COMP_PAR_AMDAHL. */ void SD_task_schedulev(SD_task_t task, int count, const sg_host_t * list) { - xbt_assert(task->kind != 0, "Task %s is not typed. Cannot automatically schedule it.", SD_task_get_name(task)); - switch (task->kind) { - case SD_TASK_COMP_PAR_AMDAHL: - SD_task_distribute_comp_amdahl(task, count); - /* no break */ - case SD_TASK_COMM_E2E: - case SD_TASK_COMP_SEQ: - xbt_assert(task->host_count == count, "Got %d locations, but were expecting %d locations", count,task->host_count); - for (int i=0; ihost_list[i] = list[i]; - if (SD_task_get_kind(task)== SD_TASK_COMP_SEQ && !task->flops_amount){ - /*This task has failed and is rescheduled. Reset the flops_amount*/ + xbt_assert(task->kind == SD_TASK_COMP_SEQ || task->kind == SD_TASK_COMP_PAR_AMDAHL, + "Task %s is not typed. Cannot automatically schedule it.", SD_task_get_name(task)); + + for(int i =0; iallocation->push_back(list[i]); + + XBT_VERB("Schedule computation task %s on %zu host(s)", task->name, task->allocation->size()); + + if (task->kind == SD_TASK_COMP_SEQ) { + if (!task->flops_amount){ /*This task has failed and is rescheduled. Reset the flops_amount*/ task->flops_amount = xbt_new0(double, 1); - task->flops_amount[0] = task->remains; + task->flops_amount[0] = task->amount; } - SD_task_do_schedule(task); - break; - default: - xbt_die("Kind of task %s not supported by SD_task_schedulev()", SD_task_get_name(task)); + XBT_VERB("It costs %.f flops", task->flops_amount[0]); } - if (task->kind == SD_TASK_COMM_E2E) { - XBT_VERB("Schedule comm task %s between %s -> %s. It costs %.f bytes", SD_task_get_name(task), - sg_host_get_name(task->host_list[0]), sg_host_get_name(task->host_list[1]), task->bytes_amount[2]); + if (task->kind == SD_TASK_COMP_PAR_AMDAHL) { + SD_task_distribute_comp_amdahl(task, count); + XBT_VERB("%.f flops will be distributed following Amdahl's Law", task->flops_amount[0]); } - /* Iterate over all inputs and outputs to say where I am located (and start them if runnable) */ - if (task->kind == SD_TASK_COMP_SEQ) { - XBT_VERB("Schedule computation task %s on %s. It costs %.f flops", SD_task_get_name(task), - sg_host_get_name(task->host_list[0]), task->flops_amount[0]); - - for (auto input : *task->inputs){ - input->host_list[1] = task->host_list[0]; - if (input->host_list[0] && (SD_task_get_state(input) < SD_SCHEDULED)) { - SD_task_do_schedule(input); - XBT_VERB ("Auto-Schedule comm task %s between %s -> %s. It costs %.f bytes", SD_task_get_name(input), - sg_host_get_name(input->host_list[0]), sg_host_get_name(input->host_list[1]), input->bytes_amount[2]); - } - } + SD_task_do_schedule(task); - for (auto output : *task->outputs){ - output->host_list[0] = task->host_list[0]; - if (output->host_list[1] && (SD_task_get_state(output) < SD_SCHEDULED)) { - SD_task_do_schedule(output); - XBT_VERB ("Auto-Schedule comm task %s between %s -> %s. It costs %.f bytes", SD_task_get_name(output), - sg_host_get_name(output->host_list[0]), sg_host_get_name(output->host_list[1]), - output->bytes_amount[2]); - } + /* Iterate over all inputs and outputs to say where I am located (and start them if runnable) */ + for (auto input : *task->inputs){ + int src_nb = input->allocation->size(); + int dst_nb = count; + if (input->allocation->empty()) + XBT_VERB("Sender side of '%s' not scheduled. Set receiver side to '%s''s allocation", input->name, task->name); + + for (int i=0; iallocation->push_back(task->allocation->at(i)); + + if (input->allocation->size () > task->allocation->size()) { + if (task->kind == SD_TASK_COMP_PAR_AMDAHL) + SD_task_build_MxN_1D_block_matrix(input, src_nb, dst_nb); + + SD_task_do_schedule(input); + XBT_VERB ("Auto-Schedule Communication task '%s'. Send %.f bytes from %d hosts to %d hosts.", + input->name,input->amount, src_nb, dst_nb); } } - /* Iterate over all children and parents being MXN_1D_BLOCK to say where I am located (and start them if runnable) */ - if (task->kind == SD_TASK_COMP_PAR_AMDAHL) { - XBT_VERB("Schedule computation task %s on %d workstations. %.f flops will be distributed following Amdahl's Law", - SD_task_get_name(task), task->host_count, task->flops_amount[0]); - for (auto input : *task->inputs){ - if (!input->host_list){ - XBT_VERB("Sender side of Task %s is not scheduled yet", SD_task_get_name(input)); - input->host_list = xbt_new0(sg_host_t, count); - input->host_count = count; - XBT_VERB("Fill the workstation list with list of Task '%s'", SD_task_get_name(task)); - for (int i=0; ihost_list[i] = task->host_list[i]; - } else { - XBT_VERB("Build communication matrix for task '%s'", SD_task_get_name(input)); - int src_nb, dst_nb; - double src_start, src_end, dst_start, dst_end; - src_nb = input->host_count; - dst_nb = count; - input->host_list = static_cast(xbt_realloc(input->host_list, (input->host_count+count)*sizeof(sg_host_t))); - for (int i=0; ihost_list[input->host_count+i] = task->host_list[i]; - - input->host_count += count; - xbt_free(input->flops_amount); - xbt_free(input->bytes_amount); - input->flops_amount = xbt_new0(double, input->host_count); - input->bytes_amount = xbt_new0(double, input->host_count* input->host_count); - - for (int i=0; iamount/src_nb; - src_end = src_start + input->amount/src_nb; - for (int j=0; jamount/dst_nb; - dst_end = dst_start + input->amount/dst_nb; - XBT_VERB("(%s->%s): (%.2f, %.2f)-> (%.2f, %.2f)", sg_host_get_name(input->host_list[i]), - sg_host_get_name(input->host_list[src_nb+j]), src_start, src_end, dst_start, dst_end); - if ((src_end <= dst_start) || (dst_end <= src_start)) { - input->bytes_amount[i*(src_nb+dst_nb)+src_nb+j]=0.0; - } else { - input->bytes_amount[i*(src_nb+dst_nb)+src_nb+j] = MIN(src_end, dst_end) - MAX(src_start, dst_start); - } - XBT_VERB("==> %.2f", input->bytes_amount[i*(src_nb+dst_nb)+src_nb+j]); - } - } - - if (SD_task_get_state(input)< SD_SCHEDULED) { - SD_task_do_schedule(input); - XBT_VERB ("Auto-Schedule redistribution task %s. Send %.f bytes from %d hosts to %d hosts.", - SD_task_get_name(input),input->amount, src_nb, dst_nb); - } - } - } + for (auto output : *task->outputs){ + int src_nb = count; + int dst_nb = output->allocation->size(); + if (output->allocation->empty()) + XBT_VERB("Receiver side of '%s' not scheduled. Set sender side to '%s''s allocation", output->name, task->name); - for (auto output : *task->outputs) { - if (!output->host_list){ - XBT_VERB("Receiver side of Task '%s' is not scheduled yet", SD_task_get_name(output)); - output->host_list = xbt_new0(sg_host_t, count); - output->host_count = count; - XBT_VERB("Fill the workstation list with list of Task '%s'", SD_task_get_name(task)); - for (int i=0; ihost_list[i] = task->host_list[i]; - } else { - double src_start, src_end, dst_start, dst_end; - int src_nb = count; - int dst_nb = output->host_count; - output->host_list = static_cast(xbt_realloc(output->host_list, (output->host_count+count)*sizeof(sg_host_t))); - for (int i=output->host_count - 1; i>=0; i--) - output->host_list[count+i] = output->host_list[i]; - for (int i=0; ihost_list[i] = task->host_list[i]; - - output->host_count += count; - - xbt_free(output->flops_amount); - xbt_free(output->bytes_amount); - - output->flops_amount = xbt_new0(double, output->host_count); - output->bytes_amount = xbt_new0(double, output->host_count* output->host_count); - - for (int i=0; iamount/src_nb; - src_end = src_start + output->amount/src_nb; - for (int j=0; jamount/dst_nb; - dst_end = dst_start + output->amount/dst_nb; - XBT_VERB("(%d->%d): (%.2f, %.2f)-> (%.2f, %.2f)", i, j, src_start, src_end, dst_start, dst_end); - if ((src_end <= dst_start) || (dst_end <= src_start)) { - output->bytes_amount[i*(src_nb+dst_nb)+src_nb+j]=0.0; - } else { - output->bytes_amount[i*(src_nb+dst_nb)+src_nb+j] = MIN(src_end, dst_end)- MAX(src_start, dst_start); - } - XBT_VERB("==> %.2f", output->bytes_amount[i*(src_nb+dst_nb)+src_nb+j]); - } - } - - if (SD_task_get_state(output)< SD_SCHEDULED) { - SD_task_do_schedule(output); - XBT_VERB ("Auto-Schedule redistribution task %s. Send %.f bytes from %d hosts to %d hosts.", - output->name, output->amount, src_nb, dst_nb); - } - } + for (int i=0; iallocation->insert(output->allocation->begin()+i, task->allocation->at(i)); + + if (output->allocation->size () > task->allocation->size()) { + if (task->kind == SD_TASK_COMP_PAR_AMDAHL) + SD_task_build_MxN_1D_block_matrix(output, src_nb, dst_nb); + + SD_task_do_schedule(output); + XBT_VERB ("Auto-Schedule Communication task %s. Send %.f bytes from %d hosts to %d hosts.", + output->name, output->amount, src_nb, dst_nb); } } } -/** @brief autoschedule a task on a list of workstations +/** @brief autoschedule a task on a list of hosts * - * This function is very similar to SD_task_schedulev(), but takes the list of workstations to schedule onto as - * separate parameters. - * It builds a proper vector of workstations and then call SD_task_schedulev() + * This function is similar to SD_task_schedulev(), but takes the list of hosts to schedule onto as separate parameters. + * It builds a proper vector of hosts and then call SD_task_schedulev() */ void SD_task_schedulel(SD_task_t task, int count, ...) { va_list ap; sg_host_t *list = xbt_new(sg_host_t, count); va_start(ap, count); - for (int i=0; i