Executing a Program on the MIT Tagged-Token Dataflow Architecture

The MIT Tagged-Token Dataflow Project has an unconventional, but integrated approach to general-purpose high-performance parallel computing. Rather than extending conventional sequential languages, Id, a high-level language with fine-grained parallelism and determinacy implicit in its operational semantics, is used. Id programs are compiled to dynamic dataflow graphs, which constitute a parallel machine language. Dataflow graphs are directly executed on the MIT tagged-token dataglow architecture (TTDA), a multiprocessor architecture. An overview of current thinking on dataflow architecture is provided by describing example Id programs, their compilation to dataflow graphs, and their execution on the TTDA. Related work and the status of the project are described. >

[1]  Jack B. Dennis,et al.  First version of a data flow procedure language , 1974, Symposium on Programming.

[2]  Wil Plouffe,et al.  An asynchronous programming language and computing machine , 1978 .

[3]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[4]  Jack B. Dennis,et al.  VAL -- A Value-Oriented Algorithmic Language (Preliminary Reference Manual), , 1979 .

[5]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.

[6]  Ken Kennedy,et al.  PFC: A Program to Convert Fortran to Parallel Form , 1982 .

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

[8]  Naohisa Takahashi,et al.  A data flow processor array system: Design and analysis , 1983, ISCA '83.

[9]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

[10]  A. Gottleib,et al.  The nyu ultracomputer- designing a mimd shared memory parallel computer , 1983 .

[11]  Arvind,et al.  Resource managers in functional programming , 1984, J. Parallel Distributed Comput..

[12]  Robin Milner,et al.  A proposal for standard ML , 1984, LFP '84.

[13]  D. E. Culler,et al.  RESOURCE MANAGEMENT FOR THE TAGGED TOKEN DATAFLOW ARCHITECTURE , 1985 .

[14]  Toshitsugu Yuba,et al.  SIGMA-1: A dataflow computer for scientific computations , 1985 .

[15]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[16]  Paul Hudak,et al.  Serial Combinators: "Optimal" Grains of Parallelism , 1985, FPCA.

[17]  William W. Wadge,et al.  Lucid, the dataflow programming language , 1985 .

[18]  Thomas Johnsson,et al.  Lambda Lifting: Treansforming Programs to Recursive Equations , 1985, FPCA.

[19]  Ian Watson,et al.  The Manchester prototype dataflow computer , 1985, CACM.

[20]  David E. Culler,et al.  Dataflow architectures , 1986 .

[21]  B J Smith,et al.  A pipelined, shared resource MIMD computer , 1986 .

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

[23]  Paul Hudak,et al.  Alfalfa: Distributed graph reduction on a hypercube multiprocessor , 1986, Graph Reduction.

[24]  Simon L. Peyton Jones,et al.  The four-stroke reduction engine , 1986, LFP '86.

[25]  Vivek Sarkar,et al.  Partitioning parallel programs for macro-dataflow , 1986, LFP '86.

[26]  D. R. Morais.  ID WORLD: AN ENVIRONMENT FOR THE DEVELOPMENT OF A DATAFLOW PROGRAMS WRITTEN IN ID , 1986 .

[27]  David E. Culler,et al.  Managing resources in a parallel machine , 1986 .

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

[29]  Arvind,et al.  Future Scientific Programming on Parallel Machines , 1988, J. Parallel Distributed Comput..

[30]  Jon Fairbairn,et al.  TIM: A simple, lazy abstract machine to execute supercombinatorics , 1987, FPCA.

[31]  Simon L. Peyton Jones,et al.  GRIP - A high-performance architecture for parallel graph reduction , 1987, FPCA.

[32]  Arvind,et al.  Two Fundamental Issues in Multiprocessing , 1987, Parallel Computing in Science and Engineering.

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

[34]  David E. Culler,et al.  Assessing the benefits of fine-grain parallelism in dataflow programs , 1988, Proceedings. SUPERCOMPUTING '88.

[35]  Arvind,et al.  Future Scientific Programming on Parallel Machines , 1988, J. Parallel Distributed Comput..

[36]  Robert A. Iannucci,et al.  A dataflow/von Neumann hybrid architecture , 1988 .

[37]  David E. Culler,et al.  Assessing the Benefits of Fine- Grain Parallelism in Dataflow Programs , 1988 .

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

[39]  John Feo,et al.  SISAL reference manual , 1990 .

[40]  Thomas Johnsson.  Efficient compilation of lazy evaluation , 1984, SIGP.

[41]  IEEE Transactions on Computers , Computing in Science & Engineering.