1 /* Copyright (c) 2013-2015. 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. */
9 #include "src/surf/trace_mgr.hpp"
11 #ifndef SURF_MODEL_CPUTI_H_
12 #define SURF_MODEL_CPUTI_H_
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_cpu_ti, surf_cpu, "Logging specific to the SURF CPU TRACE INTEGRATION module");
20 void cpu_ti_action_update_index_heap(void *action, int i)
22 (static_cast<simgrid::surf::CpuTiAction*>(action))->updateIndexHeap(i);
29 CpuTiTrace::CpuTiTrace(tmgr_trace_t speedTrace)
34 nbPoints_ = speedTrace->event_list.size() + 1;
35 timePoints_ = new double[nbPoints_];
36 integral_ = new double[nbPoints_];
37 for (auto val : speedTrace->event_list) {
38 timePoints_[i] = time;
39 integral_[i] = integral;
40 integral += val.delta * val.value;
44 timePoints_[i] = time;
45 integral_[i] = integral;
48 CpuTiTrace::~CpuTiTrace()
50 delete [] timePoints_;
54 CpuTiTgmr::~CpuTiTgmr()
61 * \brief Integrate trace
63 * Wrapper around surf_cpu_integrate_trace_simple() to get
66 * \param a Begin of interval
67 * \param b End of interval
68 * \return the integrate value. -1 if an error occurs.
70 double CpuTiTgmr::integrate(double a, double b)
74 if ((a < 0.0) || (a > b)) {
75 xbt_die("Error, invalid integration interval [%.2f,%.2f]. "
76 "You probably have a task executing with negative computation amount. Check your code.", a, b);
78 if (fabs(a -b) < EPSILON)
81 if (type_ == TRACE_FIXED) {
82 return ((b - a) * value_);
85 if (fabs(ceil(a / lastTime_) - a / lastTime_) < EPSILON)
86 a_index = 1 + static_cast<int>(ceil(a / lastTime_));
88 a_index = static_cast<int> (ceil(a / lastTime_));
90 int b_index = static_cast<int> (floor(b / lastTime_));
92 if (a_index > b_index) { /* Same chunk */
93 return trace_->integrateSimple(a - (a_index - 1) * lastTime_, b - (b_index) * lastTime_);
96 double first_chunk = trace_->integrateSimple(a - (a_index - 1) * lastTime_, lastTime_);
97 double middle_chunk = (b_index - a_index) * total_;
98 double last_chunk = trace_->integrateSimple(0.0, b - (b_index) * lastTime_);
100 XBT_DEBUG("first_chunk=%.2f middle_chunk=%.2f last_chunk=%.2f\n", first_chunk, middle_chunk, last_chunk);
102 return (first_chunk + middle_chunk + last_chunk);
106 * \brief Auxiliary function to compute the integral between a and b.
107 * It simply computes the integrals at point a and b and returns the difference between them.
108 * \param a Initial point
109 * \param b Final point
111 double CpuTiTrace::integrateSimple(double a, double b)
113 return integrateSimplePoint(b) - integrateSimplePoint(a);
117 * \brief Auxiliary function to compute the integral at point a.
120 double CpuTiTrace::integrateSimplePoint(double a)
124 int ind = binarySearch(timePoints_, a, 0, nbPoints_ - 1);
125 integral += integral_[ind];
127 XBT_DEBUG("a %f ind %d integral %f ind + 1 %f ind %f time +1 %f time %f",
128 a, ind, integral, integral_[ind + 1], integral_[ind], timePoints_[ind + 1], timePoints_[ind]);
129 double_update(&a_aux, timePoints_[ind], sg_maxmin_precision*sg_surf_precision);
131 integral += ((integral_[ind + 1] - integral_[ind]) / (timePoints_[ind + 1] - timePoints_[ind])) *
132 (a - timePoints_[ind]);
133 XBT_DEBUG("Integral a %f = %f", a, integral);
139 * \brief Computes the time needed to execute "amount" on cpu.
141 * Here, amount can span multiple trace periods
143 * \param a Initial time
144 * \param amount Amount to be executed
147 double CpuTiTgmr::solve(double a, double amount)
149 /* Fix very small negative numbers */
150 if ((a < 0.0) && (a > -EPSILON)) {
153 if ((amount < 0.0) && (amount > -EPSILON)) {
158 if ((a < 0.0) || (amount < 0.0)) {
159 XBT_CRITICAL ("Error, invalid parameters [a = %.2f, amount = %.2f]. "
160 "You probably have a task executing with negative computation amount. Check your code.", a, amount);
164 /* At this point, a and amount are positive */
165 if (amount < EPSILON)
168 /* Is the trace fixed ? */
169 if (type_ == TRACE_FIXED) {
170 return (a + (amount / value_));
173 XBT_DEBUG("amount %f total %f", amount, total_);
174 /* Reduce the problem to one where amount <= trace_total */
175 int quotient = static_cast<int>(floor(amount / total_));
176 double reduced_amount = (total_) * ((amount / total_) - floor(amount / total_));
177 double reduced_a = a - (lastTime_) * static_cast<int>(floor(a / lastTime_));
179 XBT_DEBUG("Quotient: %d reduced_amount: %f reduced_a: %f", quotient, reduced_amount, reduced_a);
181 /* Now solve for new_amount which is <= trace_total */
182 double reduced_b = solveSomewhatSimple(reduced_a, reduced_amount);
184 /* Re-map to the original b and amount */
185 double b = (lastTime_) * static_cast<int>(floor(a / lastTime_)) + (quotient * lastTime_) + reduced_b;
190 * \brief Auxiliary function to solve integral
192 * Here, amount is <= trace->total
193 * and a <=trace->last_time
196 double CpuTiTgmr::solveSomewhatSimple(double a, double amount)
200 XBT_DEBUG("Solve integral: [%.2f, amount=%.2f]", a, amount);
201 double amount_till_end = integrate(a, lastTime_);
203 if (amount_till_end > amount) {
204 b = trace_->solveSimple(a, amount);
206 b = lastTime_ + trace_->solveSimple(0.0, amount - amount_till_end);
212 * \brief Auxiliary function to solve integral.
213 * It returns the date when the requested amount of flops is available
214 * \param a Initial point
215 * \param amount Amount of flops
216 * \return The date when amount is available.
218 double CpuTiTrace::solveSimple(double a, double amount)
220 double integral_a = integrateSimplePoint(a);
221 int ind = binarySearch(integral_, integral_a + amount, 0, nbPoints_ - 1);
222 double time = timePoints_[ind];
223 time += (integral_a + amount - integral_[ind]) /
224 ((integral_[ind + 1] - integral_[ind]) / (timePoints_[ind + 1] - timePoints_[ind]));
230 * \brief Auxiliary function to update the CPU speed scale.
232 * This function uses the trace structure to return the speed scale at the determined time a.
234 * \return CPU speed scale
236 double CpuTiTgmr::getPowerScale(double a)
238 double reduced_a = a - floor(a / lastTime_) * lastTime_;
239 int point = trace_->binarySearch(trace_->timePoints_, reduced_a, 0, trace_->nbPoints_ - 1);
240 s_tmgr_event_t val = speedTrace_->event_list.at(point);
245 * \brief Creates a new integration trace from a tmgr_trace_t
247 * \param speedTrace CPU availability trace
248 * \param value Percentage of CPU speed available (useful to fixed tracing)
249 * \return Integration trace structure
251 CpuTiTgmr::CpuTiTgmr(tmgr_trace_t speedTrace, double value) :
252 speedTrace_(speedTrace)
254 double total_time = 0.0;
257 /* no availability file, fixed trace */
261 XBT_DEBUG("No availability trace. Constant value = %f", value);
265 /* only one point available, fixed trace */
266 if (speedTrace->event_list.size() == 1) {
267 s_tmgr_event_t val = speedTrace->event_list.front();
273 type_ = TRACE_DYNAMIC;
275 /* count the total time of trace file */
276 for (auto val : speedTrace->event_list)
277 total_time += val.delta;
279 trace_ = new CpuTiTrace(speedTrace);
280 lastTime_ = total_time;
281 total_ = trace_->integrateSimple(0, total_time);
283 XBT_DEBUG("Total integral %f, last_time %f ", total_, lastTime_);
287 * \brief Binary search in array.
288 * It returns the first point of the interval in which "a" is.
290 * \param a Value to search
291 * \param low Low bound to search in array
292 * \param high Upper bound to search in array
293 * \return Index of point
295 int CpuTiTrace::binarySearch(double *array, double a, int low, int high)
297 xbt_assert(low < high, "Wrong parameters: low (%d) should be smaller than high (%d)", low, high);
301 mid = low + (high - low) / 2;
302 XBT_DEBUG("a %f low %d high %d mid %d value %f", a, low, high, mid, array[mid]);
309 while (low < high - 1);
321 void surf_cpu_model_init_ti()
323 xbt_assert(!surf_cpu_model_pm,"CPU model already initialized. This should not happen.");
324 xbt_assert(!surf_cpu_model_vm,"CPU model already initialized. This should not happen.");
326 surf_cpu_model_pm = new simgrid::surf::CpuTiModel();
327 all_existing_models->push_back(surf_cpu_model_pm);
329 surf_cpu_model_vm = new simgrid::surf::CpuTiModel();
330 all_existing_models->push_back(surf_cpu_model_vm);
336 CpuTiModel::CpuTiModel() : CpuModel()
338 runningActionSetThatDoesNotNeedBeingChecked_ = new ActionList();
340 modifiedCpu_ = new CpuTiList();
342 tiActionHeap_ = xbt_heap_new(8, nullptr);
343 xbt_heap_set_update_callback(tiActionHeap_, cpu_ti_action_update_index_heap);
346 CpuTiModel::~CpuTiModel()
348 surf_cpu_model_pm = nullptr;
349 delete runningActionSetThatDoesNotNeedBeingChecked_;
351 xbt_heap_free(tiActionHeap_);
354 Cpu *CpuTiModel::createCpu(simgrid::s4u::Host *host, std::vector<double>* speedPerPstate, int core)
356 return new CpuTi(this, host, speedPerPstate, core);
359 double CpuTiModel::nextOccuringEvent(double now)
361 double min_action_duration = -1;
363 /* iterates over modified cpus to update share resources */
364 for(CpuTiList::iterator it(modifiedCpu_->begin()), itend(modifiedCpu_->end()) ; it != itend ;) {
367 ti->updateActionsFinishTime(now);
370 /* get the min next event if heap not empty */
371 if (xbt_heap_size(tiActionHeap_) > 0)
372 min_action_duration = xbt_heap_maxkey(tiActionHeap_) - now;
374 XBT_DEBUG("Share resources, min next event date: %f", min_action_duration);
376 return min_action_duration;
379 void CpuTiModel::updateActionsState(double now, double /*delta*/)
381 while ((xbt_heap_size(tiActionHeap_) > 0) && (xbt_heap_maxkey(tiActionHeap_) <= now)) {
382 CpuTiAction *action = static_cast<CpuTiAction*>(xbt_heap_pop(tiActionHeap_));
383 XBT_DEBUG("Action %p: finish", action);
385 /* set the remains to 0 due to precision problems when updating the remaining amount */
386 action->setRemains(0);
387 action->setState(Action::State::done);
388 /* update remaining amount of all actions */
389 action->cpu_->updateRemainingAmount(surf_get_clock());
396 CpuTi::CpuTi(CpuTiModel *model, simgrid::s4u::Host *host, std::vector<double> *speedPerPstate, int core)
397 : Cpu(model, host, speedPerPstate, core)
399 xbt_assert(core==1,"Multi-core not handled by this model yet");
402 actionSet_ = new ActionTiList();
404 speed_.peak = speedPerPstate->front();
405 XBT_DEBUG("CPU create: peak=%f", speed_.peak);
407 speedIntegratedTrace_ = new CpuTiTgmr(nullptr, 1/*scale*/);
413 delete speedIntegratedTrace_;
416 void CpuTi::setSpeedTrace(tmgr_trace_t trace)
418 if (speedIntegratedTrace_)
419 delete speedIntegratedTrace_;
421 speedIntegratedTrace_ = new CpuTiTgmr(trace, speed_.scale);
423 /* add a fake trace event if periodicity == 0 */
424 if (trace && trace->event_list.size() > 1) {
425 s_tmgr_event_t val = trace->event_list.back();
426 if (val.delta < 1e-12)
427 speed_.event = future_evt_set->add_trace(tmgr_empty_trace_new(), 0.0, this);
431 void CpuTi::apply_event(tmgr_trace_iterator_t event, double value)
433 if (event == speed_.event) {
434 tmgr_trace_t speedTrace;
437 XBT_DEBUG("Finish trace date: value %f", value);
438 /* update remaining of actions and put in modified cpu swag */
439 updateRemainingAmount(surf_get_clock());
443 speedTrace = speedIntegratedTrace_->speedTrace_;
444 s_tmgr_event_t val = speedTrace->event_list.back();
445 delete speedIntegratedTrace_;
446 speed_.scale = val.value;
448 trace = new CpuTiTgmr(TRACE_FIXED, val.value);
449 XBT_DEBUG("value %f", val.value);
451 speedIntegratedTrace_ = trace;
453 tmgr_trace_event_unref(&speed_.event);
455 } else if (event == stateEvent_) {
458 host_that_restart.push_back(getHost());
462 double date = surf_get_clock();
464 /* put all action running on cpu to failed */
465 for(ActionTiList::iterator it(actionSet_->begin()), itend(actionSet_->end()); it != itend ; ++it) {
467 CpuTiAction *action = &*it;
468 if (action->getState() == Action::State::running
469 || action->getState() == Action::State::ready
470 || action->getState() == Action::State::not_in_the_system) {
471 action->setFinishTime(date);
472 action->setState(Action::State::failed);
473 if (action->indexHeap_ >= 0) {
474 CpuTiAction* heap_act = static_cast<CpuTiAction*>(
475 xbt_heap_remove(static_cast<CpuTiModel*>(model())->tiActionHeap_, action->indexHeap_));
476 if (heap_act != action)
482 tmgr_trace_event_unref(&stateEvent_);
485 xbt_die("Unknown event!\n");
489 void CpuTi::updateActionsFinishTime(double now)
492 double sum_priority = 0.0;
494 double min_finish = -1;
496 /* update remaining amount of actions */
497 updateRemainingAmount(now);
499 for(ActionTiList::iterator it(actionSet_->begin()), itend(actionSet_->end()) ; it != itend ; ++it) {
501 /* action not running, skip it */
502 if (action->getStateSet() != surf_cpu_model_pm->getRunningActionSet())
505 /* bogus priority, skip it */
506 if (action->getPriority() <= 0)
509 /* action suspended, skip it */
510 if (action->suspended_ != 0)
513 sum_priority += 1.0 / action->getPriority();
515 sumPriority_ = sum_priority;
517 for(ActionTiList::iterator it(actionSet_->begin()), itend(actionSet_->end()) ; it != itend ; ++it) {
520 /* action not running, skip it */
521 if (action->getStateSet() != surf_cpu_model_pm->getRunningActionSet())
524 /* verify if the action is really running on cpu */
525 if (action->suspended_ == 0 && action->getPriority() > 0) {
526 /* total area needed to finish the action. Used in trace integration */
527 total_area = (action->getRemains()) * sum_priority * action->getPriority();
529 total_area /= speed_.peak;
531 action->setFinishTime(speedIntegratedTrace_->solve(now, total_area));
532 /* verify which event will happen before (max_duration or finish time) */
533 if (action->getMaxDuration() > NO_MAX_DURATION &&
534 action->getStartTime() + action->getMaxDuration() < action->finishTime_)
535 min_finish = action->getStartTime() + action->getMaxDuration();
537 min_finish = action->finishTime_;
539 /* put the max duration time on heap */
540 if (action->getMaxDuration() > NO_MAX_DURATION)
541 min_finish = action->getStartTime() + action->getMaxDuration();
543 /* add in action heap */
544 XBT_DEBUG("action(%p) index %d", action, action->indexHeap_);
545 if (action->indexHeap_ >= 0) {
546 CpuTiAction* heap_act = static_cast<CpuTiAction*>(
547 xbt_heap_remove(static_cast<CpuTiModel*>(model())->tiActionHeap_, action->indexHeap_));
548 if (heap_act != action)
551 if (min_finish > NO_MAX_DURATION)
552 xbt_heap_push(static_cast<CpuTiModel*>(model())->tiActionHeap_, action, min_finish);
554 XBT_DEBUG("Update finish time: Cpu(%s) Action: %p, Start Time: %f Finish Time: %f Max duration %f", cname(), action,
555 action->getStartTime(), action->finishTime_, action->getMaxDuration());
557 /* remove from modified cpu */
563 return !actionSet_->empty();
566 double CpuTi::getAvailableSpeed()
568 speed_.scale = speedIntegratedTrace_->getPowerScale(surf_get_clock());
569 return Cpu::getAvailableSpeed();
572 /** @brief Update the remaining amount of actions */
573 void CpuTi::updateRemainingAmount(double now)
576 /* already updated */
577 if (lastUpdate_ >= now)
580 /* compute the integration area */
581 double area_total = speedIntegratedTrace_->integrate(lastUpdate_, now) * speed_.peak;
582 XBT_DEBUG("Flops total: %f, Last update %f", area_total, lastUpdate_);
584 for(ActionTiList::iterator it(actionSet_->begin()), itend(actionSet_->end()) ; it != itend ; ++it) {
585 CpuTiAction *action = &*it;
586 /* action not running, skip it */
587 if (action->getStateSet() != model()->getRunningActionSet())
590 /* bogus priority, skip it */
591 if (action->getPriority() <= 0)
594 /* action suspended, skip it */
595 if (action->suspended_ != 0)
598 /* action don't need update */
599 if (action->getStartTime() >= now)
602 /* skip action that are finishing now */
603 if (action->finishTime_ >= 0 && action->finishTime_ <= now)
606 /* update remaining */
607 action->updateRemains(area_total / (sumPriority_ * action->getPriority()));
608 XBT_DEBUG("Update remaining action(%p) remaining %f", action, action->remains_);
613 CpuAction *CpuTi::execution_start(double size)
615 XBT_IN("(%s,%g)", cname(), size);
616 CpuTiAction* action = new CpuTiAction(static_cast<CpuTiModel*>(model()), size, isOff(), this);
618 actionSet_->push_back(*action);
625 CpuAction *CpuTi::sleep(double duration)
628 duration = MAX(duration, sg_surf_precision);
630 XBT_IN("(%s,%g)", cname(), duration);
631 CpuTiAction* action = new CpuTiAction(static_cast<CpuTiModel*>(model()), 1.0, isOff(), this);
633 action->maxDuration_ = duration;
634 action->suspended_ = 2;
635 if (duration == NO_MAX_DURATION) {
636 /* Move to the *end* of the corresponding action set. This convention
637 is used to speed up update_resource_state */
638 action->getStateSet()->erase(action->getStateSet()->iterator_to(*action));
639 action->stateSet_ = static_cast<CpuTiModel*>(model())->runningActionSetThatDoesNotNeedBeingChecked_;
640 action->getStateSet()->push_back(*action);
643 actionSet_->push_back(*action);
649 void CpuTi::modified(bool modified){
650 CpuTiList* modifiedCpu = static_cast<CpuTiModel*>(model())->modifiedCpu_;
652 if (!cpu_ti_hook.is_linked()) {
653 modifiedCpu->push_back(*this);
656 if (cpu_ti_hook.is_linked()) {
657 modifiedCpu->erase(modifiedCpu->iterator_to(*this));
666 CpuTiAction::CpuTiAction(CpuTiModel *model_, double cost, bool failed, CpuTi *cpu)
667 : CpuAction(model_, cost, failed)
670 cpu_->modified(true);
673 void CpuTiAction::updateIndexHeap(int i)
678 void CpuTiAction::setState(Action::State state)
680 CpuAction::setState(state);
681 cpu_->modified(true);
684 int CpuTiAction::unref()
688 if (action_hook.is_linked())
689 getStateSet()->erase(getStateSet()->iterator_to(*this));
690 /* remove from action_set */
691 if (action_ti_hook.is_linked())
692 cpu_->actionSet_->erase(cpu_->actionSet_->iterator_to(*this));
693 /* remove from heap */
694 xbt_heap_remove(static_cast<CpuTiModel*>(getModel())->tiActionHeap_, this->indexHeap_);
695 cpu_->modified(true);
702 void CpuTiAction::cancel()
704 this->setState(Action::State::failed);
705 xbt_heap_remove(getModel()->getActionHeap(), this->indexHeap_);
706 cpu_->modified(true);
709 void CpuTiAction::suspend()
711 XBT_IN("(%p)", this);
712 if (suspended_ != 2) {
714 xbt_heap_remove(getModel()->getActionHeap(), indexHeap_);
715 cpu_->modified(true);
720 void CpuTiAction::resume()
722 XBT_IN("(%p)", this);
723 if (suspended_ != 2) {
725 cpu_->modified(true);
730 void CpuTiAction::setMaxDuration(double duration)
734 XBT_IN("(%p,%g)", this, duration);
736 maxDuration_ = duration;
739 min_finish = (getStartTime() + getMaxDuration()) < getFinishTime() ?
740 (getStartTime() + getMaxDuration()) : getFinishTime();
742 min_finish = getFinishTime();
744 /* add in action heap */
745 if (indexHeap_ >= 0) {
746 CpuTiAction *heap_act = static_cast<CpuTiAction*>(xbt_heap_remove(getModel()->getActionHeap(), indexHeap_));
747 if (heap_act != this)
750 xbt_heap_push(getModel()->getActionHeap(), this, min_finish);
755 void CpuTiAction::setPriority(double priority)
757 XBT_IN("(%p,%g)", this, priority);
758 priority_ = priority;
759 cpu_->modified(true);
763 double CpuTiAction::getRemains()
765 XBT_IN("(%p)", this);
766 cpu_->updateRemainingAmount(surf_get_clock());
774 #endif /* SURF_MODEL_CPUTI_H_ */