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

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
Нет описания правки
Нет описания правки
 
Строка 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.


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

Текущая версия от 04:30, 11 января 2025

Data dependence graphграф зависимостей по данным.

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

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.