|
@@ -105,10 +105,10 @@ static int heft_progress_one(struct starpu_sched_component *component)
|
|
}
|
|
}
|
|
|
|
|
|
int best_task = 0;
|
|
int best_task = 0;
|
|
- double max_benefit = 0;
|
|
|
|
|
|
+ double max_benefit = max_exp_end_with_task[0] - min_exp_end_with_task[0];
|
|
|
|
|
|
/* Find the task which provides the most computation time benefit */
|
|
/* Find the task which provides the most computation time benefit */
|
|
- for (n = 1; n < ntasks; n++)
|
|
|
|
|
|
+ for (n = 0; n < ntasks; n++)
|
|
{
|
|
{
|
|
double benefit = max_exp_end_with_task[n] - min_exp_end_with_task[n];
|
|
double benefit = max_exp_end_with_task[n] - min_exp_end_with_task[n];
|
|
if (max_benefit < benefit)
|
|
if (max_benefit < benefit)
|