Next: ... Up: Chapter3 Previous: Motivation

...

Consider the dependence equations:

 for  tex2html_wrap_inline664  = 0 to 3 do

  for tex2html_wrap_inline666 = 0 to 3 do

S:   A[ tex2html_wrap_inline664 , tex2html_wrap_inline666 ] := A[ tex2html_wrap_inline674 , tex2html_wrap_inline666 ] + A[ tex2html_wrap_inline664 , tex2html_wrap_inline680 ]

There are two potential dependences arising from the three references to A.

Therefore two systems of dependence equations to solve:

  1.   Between A[ tex2html_wrap_inline704 , tex2html_wrap_inline706 ] and A[ tex2html_wrap_inline708 , tex2html_wrap_inline710 ]:

    displaymath682

  2.   Between A[ tex2html_wrap_inline704 , tex2html_wrap_inline706 ] and A[ tex2html_wrap_inline716 , tex2html_wrap_inline718 ]:

    displaymath683

((strictly we should also consider output dependences between A[ tex2html_wrap_inline704 , tex2html_wrap_inline706 ] and A[ tex2html_wrap_inline716 , tex2html_wrap_inline710 ], but this is obviously absent)).



Paul H J Kelly Thu Feb 6 22:09:21 GMT 1997