fix bug prediction computation, still have performance issue

src/sched_policies/node_heft.c

@@ -65,19 +65,25 @@ static int push_task(struct starpu_sched_node * node, struct starpu_task * task)
 	fprintf(stderr,"estimated end           ");
 	for(i = 0; i < node->nchilds; i++)
 	{
-		fprintf(stderr,"%f ",estimated_ends[i]);
+		fprintf(stderr,"%.0f ",estimated_ends[i]);
 	}
 	fprintf(stderr,"\n");
 	fprintf(stderr,"estimated end with task ");
 		for(i = 0; i < node->nchilds; i++)
 	{
-		fprintf(stderr,"%f ",estimated_ends_with_task[i]);
+		fprintf(stderr,"%.0f ",estimated_ends_with_task[i]);
+	}
+	fprintf(stderr,"\n");
+	fprintf(stderr,"transfere length        ");
+		for(i = 0; i < node->nchilds; i++)
+	{
+		fprintf(stderr,"%.0f ",estimated_transfer_length[i]);
 	}
 	fprintf(stderr,"\n");
 	fprintf(stderr,"estimated length        ");
 		for(i = 0; i < node->nchilds; i++)
 	{
-		fprintf(stderr,"%f ",estimated_lengths[i]);
+		fprintf(stderr,"%.0f ",estimated_lengths[i]);
 	}
 	fprintf(stderr,"\n\n");
 #endif
@@ -100,6 +106,7 @@ static int push_task(struct starpu_sched_node * node, struct starpu_task * task)
 			best_inode = inode;
 		}
 	}
+	//	fprintf(stderr,"push on %d\n",best_inode);
 	STARPU_ASSERT(best_inode != -1);
 	best_node = node->childs[best_inode];
 	return best_node->push_task(best_node, task);

src/sched_policies/node_sched.c

@@ -8,6 +8,9 @@
 double starpu_sched_compute_expected_time(double now, double predicted_end, double predicted_length, double predicted_transfer)
 {
 
+	if(now > predicted_end)
+		return predicted_end + predicted_length;
+
 	if (now + predicted_transfer < predicted_end)
 	{
 		/* We may hope that the transfer will be finished by