The Explicit Token Store

This paper presents an unusually simple approach to dynamic dataflow execution, called the Explicit Token Store (ETS) architecture, and its current realization in Monsoon. The essence of dynamic dataflow execution is captured by a simple transition on state bits associated with storage local to a processor. Low-level storage management is performed by the compiler in assigning nodes to slots in an activation frame, rather than dynamically in hardware. The processor is simple, highly pipelined, and quite general. There is exactly one instruction executed for each action on the dataflow graph. Thus, the machine-oriented ETS model provides new insight into the real cost of direct execution of dataflow graphs.

[1]  A. Gupta,et al.  Exploring the benefits of multiple hardware contexts in a multiprocessor architecture: preliminary results , 1989, ISCA '89.

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

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

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

[5]  Olaf M. Lubeck.  A user's view of dataflow architectures , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

[6]  James E. Rumbaugh,et al.  A Data Flow Multiprocessor , 1977, IEEE Transactions on Computers.

[7]  H. Trease,et al.  Parallel processing a real code—a case history , 1989 .

[8]  K. Ekanadham,et al.  The price of asynchronous parallelism: an analysis of dataflow architectures , 1989 .

[9]  Robert E. Benner,et al.  Development of Parallel Methods for a $1024$-Processor Hypercube , 1988 .

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

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

[12]  David E. Culler,et al.  Managing parallelism and resources in scientific dataflow programs , 1989 .

[13]  K. S. Weng.  AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE , 1980 .

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

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

[16]  John Cocke,et al.  A methodology for the real world , 1981 .

[17]  Kenji Nishida,et al.  Maintenance Architecture and Its LSI Implementation of a Dataflow Computer with a Large Number of Processors , 1986, ICPP.

[18]  V. Gerald Grafe,et al.  The Epsilon-2 hybrid dataflow architecture , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

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

[20]  Jack B. Dennis,et al.  Data Flow Supercomputers , 1980, Computer.

[21]  Joel H. Saltz,et al.  Dynamic Remapping of Parallel Computations with Varying Resource Demands , 1988, IEEE Trans. Computers.

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

[23]  Lubomir F. Bic.  A Process-Oriented Model for Efficient Execution of Dataflow Programs , 1990, J. Parallel Distributed Comput..

[24]  Jarek Deminet.  Experience with Multiprocessor Algorithms , 1982, IEEE Transactions on Computers.

[25]  Kenji Nishida,et al.  An Architecture of a Data Flow Machine and Its Evaluation , 1984, COMPCON.

[26]  T. Yuba,et al.  An architecture of a dataflow single chip processor , 1989, ISCA '89.

[27]  C. F. Joerg,et al.  DESIGN AND IMPLEMENTATION OF A PACKET SWITCHED ROUTING CHIP , 1990 .

[28]  Arvind,et al.  Programming Generality and Parallel Computers , 1988 .

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

[30]  Alan H. Karp,et al.  Programming for Parallelism , 1987, Computer.

[31]  K. R. Traub,et al.  Sequential implementation of lenient programming languages , 1988 .

[32]  R. S. Nikhil.  Can dataflow subsume von Neumann computing? , 1989, ISCA '89.

[33]  Michel Sadoune,et al.  Terminal area flight path generation using parallel constraint propagation , 1989 .

[34]  Robert M. Keller,et al.  A loosely-coupled applicative multi-processing system* , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

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

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

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