The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages

The Program Dependence Web (PDW) is a program representation that can be directly interpreted using control-, data-, or demand-driven models of execution. A PDW combines a single-assignment version of the program with explicit operators that manage the flow of data values. The PDW can be viewed as an augmented Program Dependence Graph. Translation to the PDW representation provides the basis for projects to compile Fortran onto dynamic dataflow architectures and simulators. A second application of the PDW is the construction of various compositional semantics for program dependence graphs.

[1]  Bowen Alpern,et al.  Detecting equality of variables in programs , 1988, POPL '88.

[2]  V. G. Grafe,et al.  The Epsilon dataflow processor , 1989, ISCA '89.

[3]  Stephen J. Allan,et al.  A Flow Analysis Procedure for the Translation of High-Level Languages to a Data Flow Language , 1980, IEEE Transactions on Computers.

[4]  Arvind,et al.  The U-Interpreter , 1982, Computer.

[5]  K. J. Ottenstein,et al.  Data-flow graphs as an intermediate program form. , 1978 .

[6]  V. G. Grafe,et al.  Eps'88: Combining the best features of von Neumann and dataflow computing , 1989 .

[7]  Mark N. Wegman,et al.  An efficient method of computing static single assignment form , 1989, POPL '89.

[8]  Keshav Pingali,et al.  From Control Flow to Dataflow , 1991, J. Parallel Distributed Comput..

[9]  A. H. Veen,et al.  The misconstrued semicolon: reconciling imperative languages and dataflow machines , 1986 .

[10]  R. Parsons-Selke,et al.  A rewriting semantics for program dependence graphs , 1989, POPL '89.

[11]  J OttensteinKarl,et al.  The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages , 1990 .

[12]  Gregory M. Papadopoulos,et al.  Implementation of a general purpose dataflow multiprocessor , 1991 .

[13]  Karl J. Ottenstein,et al.  Experience compiling Fortran to program dependence graphs , 1992, Softw. Pract. Exp..

[14]  W W Bradley,et al.  Summary Presentation , 1998, Folia Primatologica.

[15]  Keshav Pingali,et al.  I-structures: data structures for parallel computing , 1986, Graph Reduction.

[16]  Arvind,et al.  Executing a Program on the MIT Tagged-Token Dataflow Architecture , 1990, IEEE Trans. Computers.

[17]  Jeanne Ferrante,et al.  On linearizing parallel code , 1985, POPL.

[18]  Bradley Ww.  Summary of presentation. , 1974 .

[19]  Matthias Felleisen,et al.  The semantics of program dependence , 1989, PLDI '89.

[20]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1987, TOPL.

[21]  David A. Padua,et al.  Advanced compiler optimizations for supercomputers , 1986, CACM.

[22]  Arthur H. Veen.  Reconciling data flow machines and conventional languages , 1981, CONPAR.

[23]  K. R. Traub,et al.  A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE , 1986 .