Fix computation

doc/starpu.texi

@@ -1129,7 +1129,7 @@ immediately and get the optimized minimum.
 The @code{deps} parameter tells StarPU whether to take tasks and data
 dependencies into account. It must be understood that the linear programming
 problem size is quadratic with number of tasks and thus the time to solve it
-will be very long, typically one minute for just 200 tasks. Setting @code{deps}
+will be very long, typically 5 minutes for just 13 tasks. Setting @code{deps}
 to 0 will only takes into account the actual computations on processing
 units. It however still properly takes into account the varying performances of
 kernels and processing units, which is quite more accurate than just comparing

src/profiling/bound.c

@@ -379,9 +379,9 @@ void starpu_bound_print_lp(FILE *output)
 		for (t = tasks; t; t = t->next)
 			for (t2 = t->next; t2; t2 = t2->next) {
 				for (w = 0; w < nw; w++) {
-					fprintf(output, "s%u - c%u >= -3e10 + 1e10 t%uw%u + 1e10 t%uw%u + 1e10 t%uafter%u;\n",
+					fprintf(output, "s%u - c%u >= -3e6 + 1e6 t%uw%u + 1e6 t%uw%u + 1e6 t%uafter%u;\n",
 							t->id, t2->id, t->id, w, t2->id, w, t->id, t2->id);
-					fprintf(output, "s%u - c%u >= -2e10 + 1e10 t%uw%u + 1e10 t%uw%u - 1e10 t%uafter%u;\n",
+					fprintf(output, "s%u - c%u >= -2e6 + 1e6 t%uw%u + 1e6 t%uw%u - 1e6 t%uafter%u;\n",
 							t2->id, t->id, t->id, w, t2->id, w, t->id, t2->id);
 				}
 			}