|
|
@@ -1114,7 +1114,7 @@ input sizes, by applying a*n^b+c regression over observed execution times.
|
|
|
@node Theoretical lower bound on execution time
|
|
|
@section Theoretical lower bound on execution time
|
|
|
|
|
|
-For history-based kernels, StarPU can very easily provide a theoretical lower
|
|
|
+For kernels with history-based performance models, StarPU can very easily provide a theoretical lower
|
|
|
bound for the execution time of a whole set of tasks. See for
|
|
|
instance @code{examples/lu/lu_example.c}: before submitting tasks,
|
|
|
call @code{starpu_bound_start}, and after complete execution, call
|
|
|
@@ -1123,7 +1123,7 @@ call @code{starpu_bound_start}, and after complete execution, call
|
|
|
problem corresponding to the schedule of your tasks. Run it through
|
|
|
@code{lp_solve} or any other linear programming solver, and that will give you a
|
|
|
lower bound for the total execution time of your tasks. If StarPU was compiled
|
|
|
-with the glpk library installed, starpu_bound_compute can be used to solve it
|
|
|
+with the glpk library installed, @code{starpu_bound_compute} can be used to solve it
|
|
|
immediately and get the optimized minimum.
|
|
|
|
|
|
Note that this is not taking into account task dependencies and data
|
