Data dependence graph: различия между версиями

Перейти к навигации Перейти к поиску
нет описания правки
Нет описания правки
Нет описания правки
 
Строка 2: Строка 2:


By the '''data dependence graph''' of the program we mean a [[digraph]], where the [[vertex|vertices]] correspond to the (assignment) statements in the program, and
By the '''data dependence graph''' of the program we mean a [[digraph]], where the [[vertex|vertices]] correspond to the (assignment) statements in the program, and
there is an [[arc]] from a vertex <math>\,S</math> to a vertex <math>\,T</math> iff <math>\,T</math> depends on <math>\,S</math>; i.e. <math>\,S \delta T</math>, <math>\,S \bar{\delta} T</math> or <math>S \delta^{o} T</math>. Each arc may be labeled with information about the type of dependence and other information.
there is an [[arc]] from a vertex <math>\,S</math> to a vertex <math>\,T</math> iff <math>\,T</math> depends on <math>\,S</math>; i.e. <math>\,S \delta T</math>, <math>\,S \bar{\delta} T</math> or <math>S \delta^{o} T</math>. Each arc may be labeled with information about the type of [[Data dependence|dependence]] and other information.


==Литература==
==Литература==

Навигация