The dataflow program graph execution model, or dataflow for short, is an alternative to the stored- program (von Neumann) execution model. Because it relies on a graph representation of programs, the strengths of the dataflow model are very much the complements of those of the stored-program one. In the last thirty or so years since it was proposed, the dataflow model of computation has been us ed and developed in very many areas of computing research: from programming languages to processor design,and from signal processing to reconfigurable computing. This paper is a review of the current state-of-the-art in the applications of the dataflow model of computation. It focuses on three areas: multithreaded
|
1713
|
Statecharts: A visual formalism for complex systems
– Harel
- 1987
|
|
1345
|
The Temporal Logic of Reactive and Concurrent Systems: Specification
– Manna, Pnueli
- 1992
|
|
926
|
Active Messages: A mechanism for integrated communication and computation
– Eicken, Culler, et al.
- 1992
|
|
801
|
How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs
– Lamport
- 1979
|
|
637
|
Memory consistency and event ordering in scalable shared-memory multiprocessors
– Gharachorloo, Lenoski, et al.
- 1990
|
|
459
|
Semantics of a Simple Language for Parallel Programming
– Kahn
- 1974
|
|
387
|
Ptolemy: A framework for simulating and prototyping heterogeneous systems
– Buck, Ha, et al.
- 1994
|
|
336
|
The synchronous data flow programming language
– Halbwachs, Caspi, et al.
- 1991
|
|
323
|
Tempest and Typhoon: User-Level Shared Memory
– Reinhardt, Larus, et al.
- 1994
|
|
283
|
The synchronous approach to reactive and real-time systems
– Benveniste, Berry
- 1991
|
|
271
|
Static scheduling of synchronous data flow programs for digital signal processing
– Lee, Messerschmitt
- 1987
|
|
258
|
Garp: A MIPS Processor with a Reconfigurable Coprocessor. FCCM’97 pagg 12-21
– Hauser, Wawrzynek
- 1997
|
|
200
|
I-structures: Data structures for parallel computing
– Arvind, Pingali
- 1989
|
|
164
|
Dataflow process networks
– Lee, Parks
- 1995
|
|
147
|
Processor Reconfiguration through Instruction-Set Metamorphosis
– Athanas, H
- 1993
|
|
139
|
Baring it all to software: Raw machines
– Waingold, Taylor, et al.
- 1997
|
|
124
|
A parallel hashed oct-tree n-body algorithm
– Warren, Salmon
- 1993
|
|
123
|
Executing a program on the MIT tagged-token dataflow architecture
– Arvind, Nikhil
- 1990
|
|
121
|
Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model
– Buck
- 1993
|
|
112
|
The DASH Prototype: Implementation and Performance
– Lenoski, Laudon, et al.
- 1992
|
|
108
|
A dataflow/von Neumann hybrid architecture
– Iannucci
- 1988
|
|
103
|
First version data flow procedure language
– Dennis
- 1975
|
|
100
|
Programmable active memories: a performance assessment
– Bertin, Roncin, et al.
- 1993
|
|
89
|
M-structures: Extending a parallel, non-strict, functional language with state
– Barth, Nikhil, et al.
- 1991
|
|
71
|
Building and using a highly parallel programmable logic array
– Gokhale, Holmes, et al.
- 1991
|
|
67
|
Data Flow Program Graphs
– Davis, Keller
- 1982
|
|
60
|
Multiprocessors Should Support Simple Memory Consistency Models
– Hill
- 1998
|
|
56
|
Two fundamental issues in multiprocessing
– Arvind, Ianucci
- 1987
|
|
56
|
Hierarchical finite state machines with multiple concurrency models
– Girault, Lee, et al.
- 1999
|
|
55
|
RaPiD - reconfigurable pipelined datapath
– Ebeling, Cronquist, et al.
- 1996
|
|
54
|
Scaling Parallel Programs for Multiprocessors: Methodology and Examples
– Singh, Hennessy, et al.
- 1987
|
|
53
|
StarT-NG: Delivering Seamless Parallel Computing
– Chiou, Ang, et al.
- 1995
|
|
45
|
A study of the EARTH-MANNA multithreaded system
– Hum, Maquelin, et al.
- 1996
|
|
41
|
Ashford: Consistency in Dataflow Graphs
– Lee
- 1991
|
|
39
|
StarT the Next Generation: Integrating global caches and dataflow architecture
– Ang, Arvind, et al.
- 1994
|
|
38
|
Static Scheduling and Code Generation from Dynamic Dataflow Graphs with Integer Valued Control Streams
– Buck
- 1994
|
|
32
|
Managing Pipeline-Reconfigurable FPGAs
– Cadambi, Weener, et al.
- 1998
|
|
29
|
Location consistency - a new memory model and cache consistency protocol
– Gao, Sarkar
- 1998
|
|
27
|
Compiling C for the EARTH multithreaded architecture
– Hendren, Tang, et al.
- 1997
|
|
25
|
Multithreaded architectures: principles, projects, and issues”; in: “Multithreaded Computer Architecture: a Summary of the State fo the Art
– Dennis, Gao
- 1994
|
|
24
|
Pam programming environments: practice and experience
– Bertin, Touati
- 1994
|
|
23
|
Seeking Solutions in Configurable Computing
– Mangione-Smith, Hutchings, et al.
- 1997
|
|
22
|
An efficient pipelined dataflow processor architecture
– Dennis, Gao
- 1988
|
|
21
|
Multithreaded Computer Architecture: A Summary of the State of the Art
– Iannucci, Gao, et al.
- 1994
|
|
21
|
Super-threading: Architectural and software mechanisms for optimizing parallel computation
– Sakai, Okamoto, et al.
|
|
21
|
EARTH: An Efficient Architecture for Running Threads
– Theobald
- 1999
|
|
20
|
Location consistency: stepping beyond the barriers of memory coherence and serializability
– Gao, Sarkar
- 1994
|
|
18
|
A Data-Driven VLSI Array for Arbitrary Algorithms
– Koren, Mendelson, et al.
- 1988
|
|
18
|
A Denotational semantics for dataflow with firing
– Lee
- 1997
|
|
17
|
An efficient hybrid dataflow architecture model
– Gao
- 1993
|
