Next: ... Up: Ch05-CompilerIssues Previous: ...

   
Dependence distance

In many common examples, the set of solution pairs is characterised easily:

Definition: dependence distance

For example in the loop we considered earlier,

\fbox{\begin{minipage}{6em}{\tt\begin{tabbing}
$S_1:$\space \= A[0] := 0\\
\> ...
... 1 to 5\\
$S_2:$\space \> ~ A[I] := A[I-1] + B[I]
\end{tabbing}}\end{minipage}}

We find that $S_2 ~\delta_{<}~ S_2$ with dependence distance 1.

((of course there are many cases where the difference is not constant and so the dependence cannot be summarised this way)).