Estimating minimum execution time of perfect loop nests with loop-carried dependences
We propose a scheme to estimate exact minimum parallel execution time of perfect loop nests with loop-carried dependences at iteration and instruction-level parallelism. We formulate the problem of the estimation as an integer programming problem and solve it with a branch- and-bound scheme combined with the simplex method. Execution time obtained with the proposed scheme is useful to evaluate effects of applications of various optimization or parallelizing techniques for iteration or instruction-level parallel execution of loops.
Unable to display preview. Download preview PDF.