+ auto task = new Task();
+ task->set_name(name);
+ task->set_amount(amount);
+ task->set_data(userdata);
+ task->allocation_ = new std::vector<sg_host_t>();
+ sd_global->initial_tasks.insert(task);
+
+ return task;
+}
+
+Task* Task::create_comm_e2e(const std::string& name, double amount, void* userdata)
+{
+ auto task = create(name, amount, userdata);
+ task->bytes_amount_ = xbt_new0(double, 4);
+ task->bytes_amount_[2] = amount;
+ task->set_kind(SD_TASK_COMM_E2E);
+
+ return task;
+}
+
+Task* Task::create_comp_seq(const std::string& name, double amount, void* userdata)
+{
+ auto task = create(name, amount, userdata);
+ task->flops_amount_ = xbt_new0(double, 1);
+ task->flops_amount_[0] = amount;
+ task->set_kind(SD_TASK_COMP_SEQ);
+
+ return task;
+}
+
+Task* Task::create_comp_par_amdahl(const std::string& name, double amount, void* userdata, double alpha)
+{
+ xbt_assert(alpha < 1. && alpha >= 0., "Invalid parameter: alpha must be in [0.;1.[");
+
+ auto task = create(name, amount, userdata);
+ task->set_alpha(alpha);
+ task->set_kind(SD_TASK_COMP_PAR_AMDAHL);
+
+ return task;
+}
+
+Task* Task::create_comm_par_mxn_1d_block(const std::string& name, double amount, void* userdata)
+{
+ auto task = create(name, amount, userdata);
+ task->set_kind(SD_TASK_COMM_PAR_MXN_1D_BLOCK);
+
+ return task;
+}
+
+void Task::distribute_comp_amdahl(int count)
+{
+ xbt_assert(kind_ == SD_TASK_COMP_PAR_AMDAHL,
+ "Task %s is not a SD_TASK_COMP_PAR_AMDAHL typed task."
+ "Cannot use this function.",
+ get_cname());
+ flops_amount_ = xbt_new0(double, count);
+ for (int i = 0; i < count; i++)
+ flops_amount_[i] = (alpha_ + (1 - alpha_) / count) * amount_;
+}
+
+void Task::build_MxN_1D_block_matrix(int src_nb, int dst_nb)
+{
+ xbt_assert(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.",
+ get_cname());
+ xbt_free(bytes_amount_);
+ bytes_amount_ = xbt_new0(double, allocation_->size() * allocation_->size());
+
+ for (int i = 0; i < src_nb; i++) {
+ double src_start = i * amount_ / src_nb;
+ double src_end = src_start + amount_ / src_nb;
+ for (int j = 0; j < dst_nb; j++) {
+ double dst_start = j * amount_ / dst_nb;
+ double dst_end = dst_start + amount_ / dst_nb;
+ XBT_VERB("(%d->%d): (%.2f, %.2f)-> (%.2f, %.2f)", i, j, src_start, src_end, dst_start, dst_end);
+ 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 */
+ bytes_amount_[i * (src_nb + dst_nb) + src_nb + j] = std::min(src_end, dst_end) - std::max(src_start, dst_start);
+ XBT_VERB("==> %.2f", bytes_amount_[i * (src_nb + dst_nb) + src_nb + j]);
+ }
+ }
+ }
+}
+
+bool Task::is_parent_of(Task* task) const
+{
+ return (successors_.find(task) != successors_.end() || outputs_.find(task) != outputs_.end());
+}
+
+bool Task::is_child_of(Task* task) const
+{
+ return (inputs_.find(task) != inputs_.end() || predecessors_.find(task) != predecessors_.end());
+}
+
+void Task::set_amount(double amount)
+{
+ amount_ = amount;
+ if (kind_ == SD_TASK_COMP_SEQ)
+ flops_amount_[0] = amount;
+ if (kind_ == SD_TASK_COMM_E2E) {
+ bytes_amount_[2] = amount;
+ }
+}
+
+void Task::set_rate(double rate)
+{
+ xbt_assert(kind_ == SD_TASK_COMM_E2E, "The rate can be modified for end-to-end communications only.");
+ if (state_ < SD_RUNNING) {
+ rate_ = rate;
+ } else {
+ XBT_WARN("Task %p has started. Changing rate is ineffective.", this);
+ }
+}
+void Task::set_state(e_SD_task_state_t new_state)
+{
+ std::set<Task*>::iterator idx;
+ XBT_DEBUG("Set state of '%s' to %d", get_cname(), new_state);
+ if ((new_state == SD_NOT_SCHEDULED || new_state == SD_SCHEDULABLE) && state_ == SD_FAILED) {
+ sd_global->completed_tasks.erase(this);
+ sd_global->initial_tasks.insert(this);
+ }
+
+ if (new_state == SD_SCHEDULED && state_ == SD_RUNNABLE) {
+ sd_global->initial_tasks.insert(this);
+ sd_global->runnable_tasks.erase(this);
+ }
+
+ if (new_state == SD_RUNNABLE) {
+ idx = sd_global->initial_tasks.find(this);
+ if (idx != sd_global->initial_tasks.end()) {
+ sd_global->runnable_tasks.insert(*idx);
+ sd_global->initial_tasks.erase(idx);
+ }
+ }
+
+ if (new_state == SD_RUNNING)
+ sd_global->runnable_tasks.erase(this);
+
+ if (new_state == SD_DONE || new_state == SD_FAILED) {
+ sd_global->completed_tasks.insert(this);
+ start_time_ = surf_action_->get_start_time();
+ if (new_state == SD_DONE) {
+ finish_time_ = surf_action_->get_finish_time();
+#if SIMGRID_HAVE_JEDULE
+ jedule_log_sd_event(this);
+#endif
+ } else
+ finish_time_ = simgrid_get_clock();
+ surf_action_->unref();
+ surf_action_ = nullptr;
+ allocation_->clear();
+ }
+
+ state_ = new_state;
+
+ if (watch_points_ & new_state) {
+ XBT_VERB("Watch point reached with task '%s'!", get_cname());
+ sd_global->watch_point_reached = true;
+ unwatch(new_state); /* remove the watch point */
+ }
+}
+
+double Task::get_alpha() const
+{
+ xbt_assert(kind_ == SD_TASK_COMP_PAR_AMDAHL, "Alpha parameter is not defined for this kind of task");
+ return alpha_;
+}
+
+double Task::get_remaining_amount() const
+{
+ if (surf_action_)
+ return surf_action_->get_remains();
+ else
+ return (state_ == SD_DONE) ? 0 : amount_;
+}
+
+double Task::get_start_time() const
+{
+ if (surf_action_)
+ return surf_action_->get_start_time();
+ else
+ return start_time_;
+}
+
+double Task::get_finish_time() const
+{
+ if (surf_action_) /* should never happen as actions are destroyed right after their completion */
+ return surf_action_->get_finish_time();
+ else
+ return finish_time_;
+}
+
+void Task::set_sender_side_allocation(unsigned long count, const std::vector<s4u::Host*>* sender)
+{
+ for (unsigned long i = 0; i < count; i++)
+ allocation_->push_back(sender->at(i));
+}
+
+void Task::set_receiver_side_allocation(unsigned long count, const std::vector<s4u::Host*>* receiver)
+{
+ for (unsigned long i = 0; i < count; i++)
+ allocation_->insert(allocation_->begin() + i, receiver->at(i));
+}
+
+void Task::watch(e_SD_task_state_t state)
+{
+ if (state & SD_NOT_SCHEDULED)
+ throw std::invalid_argument("Cannot add a watch point for state SD_NOT_SCHEDULED");
+
+ watch_points_ = watch_points_ | state;
+}
+
+void Task::unwatch(e_SD_task_state_t state)
+{
+ xbt_assert(state != SD_NOT_SCHEDULED, "SimDag error: Cannot have a watch point for state SD_NOT_SCHEDULED");
+ watch_points_ = watch_points_ & ~state;
+}
+
+void Task::dump() const
+{
+ XBT_INFO("Displaying task %s", get_cname());
+ if (state_ == SD_RUNNABLE)
+ XBT_INFO(" - state: runnable");
+ else if (state_ < SD_RUNNABLE)
+ XBT_INFO(" - state: %s not runnable", __get_state_name(state_));
+ else
+ XBT_INFO(" - state: not runnable %s", __get_state_name(state_));
+
+ if (kind_ != 0) {
+ switch (kind_) {
+ case SD_TASK_COMM_E2E:
+ XBT_INFO(" - kind: end-to-end communication");
+ break;
+ case SD_TASK_COMP_SEQ:
+ XBT_INFO(" - kind: sequential computation");
+ break;
+ case SD_TASK_COMP_PAR_AMDAHL:
+ XBT_INFO(" - kind: parallel computation following Amdahl's law");
+ break;
+ case SD_TASK_COMM_PAR_MXN_1D_BLOCK:
+ XBT_INFO(" - kind: MxN data redistribution assuming 1D block distribution");
+ break;
+ default:
+ XBT_INFO(" - (unknown kind %d)", kind_);
+ }
+ }
+
+ XBT_INFO(" - amount: %.0f", amount_);
+ if (kind_ == SD_TASK_COMP_PAR_AMDAHL)
+ XBT_INFO(" - alpha: %.2f", alpha_);
+ XBT_INFO(" - Dependencies to satisfy: %lu", has_unsolved_dependencies());
+ if (has_unsolved_dependencies() > 0) {
+ XBT_INFO(" - pre-dependencies:");
+ for (auto const& it : predecessors_)
+ XBT_INFO(" %s", it->get_cname());
+
+ for (auto const& it : inputs_)
+ XBT_INFO(" %s", it->get_cname());
+ }
+ if (is_waited_by() > 0) {
+ XBT_INFO(" - post-dependencies:");
+
+ for (auto const& it : successors_)
+ XBT_INFO(" %s", it->get_cname());
+ for (auto const& it : outputs_)
+ XBT_INFO(" %s", it->get_cname());
+ }
+}
+
+void Task::released_by(Task* pred)
+{
+ predecessors_.erase(pred);
+ inputs_.erase(pred);
+ XBT_DEBUG("Release dependency on %s: %lu remain(s). Becomes schedulable if %zu=0", get_cname(),
+ has_unsolved_dependencies(), predecessors_.size());
+
+ if (state_ == SD_NOT_SCHEDULED && predecessors_.empty())
+ set_state(SD_SCHEDULABLE);
+
+ if (state_ == SD_SCHEDULED && has_unsolved_dependencies() == 0)
+ set_state(SD_RUNNABLE);
+
+ if (state_ == SD_RUNNABLE && not sd_global->watch_point_reached)
+ run();
+}
+
+void Task::produced_by(Task* pred)
+{
+ start_time_ = pred->get_finish_time();
+ predecessors_.erase(pred);
+ if (state_ == SD_SCHEDULED)
+ set_state(SD_RUNNABLE);
+ else
+ set_state(SD_SCHEDULABLE);
+
+ Task* comm_dst = *(successors_.begin());
+ if (comm_dst->get_state() == SD_NOT_SCHEDULED && comm_dst->get_predecessors().empty()) {
+ XBT_DEBUG("%s is a transfer, %s may be ready now if %zu=0", get_cname(), comm_dst->get_cname(),
+ comm_dst->get_predecessors().size());
+ comm_dst->set_state(SD_SCHEDULABLE);
+ }
+ if (state_ == SD_RUNNABLE && not sd_global->watch_point_reached)
+ run();
+}
+
+void Task::do_schedule()
+{
+ if (state_ > SD_SCHEDULABLE)
+ throw std::invalid_argument(simgrid::xbt::string_printf("Task '%s' has already been scheduled", get_cname()));
+
+ if (has_unsolved_dependencies() == 0)
+ set_state(SD_RUNNABLE);
+ else
+ set_state(SD_SCHEDULED);
+}
+
+void Task::schedule(const std::vector<s4u::Host*>& hosts, const double* flops_amount, const double* bytes_amount,
+ double rate)
+{
+ unsigned long host_count = hosts.size();
+ rate_ = rate;
+
+ if (flops_amount) {
+ flops_amount_ = static_cast<double*>(xbt_realloc(flops_amount_, sizeof(double) * host_count));
+ memcpy(flops_amount_, flops_amount, sizeof(double) * host_count);
+ } else {
+ xbt_free(flops_amount_);
+ flops_amount_ = nullptr;
+ }
+
+ unsigned long communication_nb = host_count * host_count;
+ if (bytes_amount) {
+ bytes_amount_ = static_cast<double*>(xbt_realloc(bytes_amount_, sizeof(double) * communication_nb));
+ memcpy(bytes_amount_, bytes_amount, sizeof(double) * communication_nb);
+ } else {
+ xbt_free(bytes_amount_);
+ bytes_amount_ = nullptr;
+ }
+
+ for (unsigned long i = 0; i < host_count; i++)
+ allocation_->push_back(hosts[i]);
+
+ do_schedule();
+}
+
+void Task::schedulev(const std::vector<s4u::Host*>& hosts)
+{
+ xbt_assert(kind_ == SD_TASK_COMP_SEQ || kind_ == SD_TASK_COMP_PAR_AMDAHL,
+ "Task %s is not typed. Cannot automatically schedule it.", get_cname());
+
+ for (unsigned long i = 0; i < hosts.size(); i++)
+ allocation_->push_back(hosts[i]);
+
+ XBT_VERB("Schedule computation task %s on %zu host(s)", get_cname(), allocation_->size());
+
+ if (kind_ == SD_TASK_COMP_SEQ) {
+ if (not flops_amount_) { /*This task has failed and is rescheduled. Reset the flops_amount*/
+ flops_amount_ = xbt_new0(double, 1);
+ flops_amount_[0] = amount_;
+ }
+ XBT_VERB("It costs %.f flops", flops_amount_[0]);
+ }
+
+ if (kind_ == SD_TASK_COMP_PAR_AMDAHL) {
+ distribute_comp_amdahl(hosts.size());
+ XBT_VERB("%.f flops will be distributed following Amdahl's Law", flops_amount_[0]);
+ }
+
+ do_schedule();
+
+ /* Iterate over all inputs and outputs to say where I am located (and start them if runnable) */
+ for (auto const& input : inputs_) {
+ unsigned long src_nb = input->get_allocation_size();
+ unsigned long dst_nb = hosts.size();
+ if (src_nb == 0)
+ XBT_VERB("Sender side of '%s' not scheduled. Set receiver side to '%s''s allocation", input->get_cname(),
+ get_cname());
+ input->set_sender_side_allocation(dst_nb, allocation_);
+
+ if (input->get_allocation_size() > allocation_->size()) {
+ if (kind_ == SD_TASK_COMP_PAR_AMDAHL)
+ input->build_MxN_1D_block_matrix(src_nb, dst_nb);
+
+ input->do_schedule();
+ XBT_VERB("Auto-Schedule Communication task '%s'. Send %.f bytes from %zu hosts to %zu hosts.", input->get_cname(),
+ input->get_amount(), src_nb, dst_nb);
+ }
+ }
+
+ for (auto const& output : outputs_) {
+ unsigned long src_nb = hosts.size();
+ unsigned long dst_nb = output->get_allocation_size();
+ if (dst_nb == 0)
+ XBT_VERB("Receiver side of '%s' not scheduled. Set sender side to '%s''s allocation", output->get_cname(),
+ get_cname());
+ output->set_receiver_side_allocation(src_nb, allocation_);
+
+ if (output->get_allocation_size() > allocation_->size()) {
+ if (kind_ == SD_TASK_COMP_PAR_AMDAHL)
+ output->build_MxN_1D_block_matrix(src_nb, dst_nb);
+
+ output->do_schedule();
+ XBT_VERB("Auto-Schedule Communication task %s. Send %.f bytes from %lu hosts to %lu hosts.", output->get_cname(),
+ output->get_amount(), src_nb, dst_nb);
+ }
+ }
+}
+
+void Task::unschedule()
+{
+ if (state_ == SD_NOT_SCHEDULED || state_ == SD_SCHEDULABLE)
+ throw std::invalid_argument(xbt::string_printf(
+ "Task %s: the state must be SD_SCHEDULED, SD_RUNNABLE, SD_RUNNING or SD_FAILED", get_cname()));
+
+ if (state_ == SD_SCHEDULED || state_ == SD_RUNNABLE) /* if the task is scheduled or runnable */ {
+ allocation_->clear();
+ if (kind_ == SD_TASK_COMP_PAR_AMDAHL || kind_ == SD_TASK_COMM_PAR_MXN_1D_BLOCK) {
+ /* Don't free scheduling data for typed tasks */
+ xbt_free(flops_amount_);
+ xbt_free(bytes_amount_);
+ bytes_amount_ = nullptr;
+ flops_amount_ = nullptr;
+ }
+ }
+
+ if (state_ == SD_RUNNING)
+ /* the task should become SD_FAILED */
+ surf_action_->cancel();
+ else {
+ if (has_unsolved_dependencies() == 0)
+ set_state(SD_SCHEDULABLE);
+ else
+ set_state(SD_NOT_SCHEDULED);
+ }
+ start_time_ = -1.0;
+}
+
+void Task::run()
+{
+ xbt_assert(state_ == SD_RUNNABLE, "Task '%s' is not runnable! Task state: %d", get_cname(), (int)state_);
+ xbt_assert(not allocation_->empty(), "Task '%s': host_list is empty!", get_cname());
+
+ XBT_VERB("Executing task '%s'", get_cname());
+
+ /* Beware! The scheduling data are now used by the surf action directly! no copy was done */
+ auto host_model = allocation_->front()->get_netpoint()->get_englobing_zone()->get_host_model();
+ surf_action_ = host_model->execute_parallel(*allocation_, flops_amount_, bytes_amount_, rate_);