An Executable Representation of Distance and Direction

The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. The execution model, called dependencedriven execution, is a generalization of the tagged-token data ow model that permits imperative updates to memory. The dependence ow graph subsumes other representations such as continuation-passing style 12], data dependence graphs 13], and static single assignment form 8]. In this paper, we show how dependence distance and direction information can be represented in this model using dependence operators. From a functional perspective, these operators can be viewed as functions on streams 4].

• Type: Conference
• Year: 1991
• Where: LCPC
• Authors: Richard Johnson, Wei Li, Keshav Pingali
• Keywords: Data Dependence Graphs, Data Ow Model, Dependence Ow Graph, LCPC 1991, System Software