Download:
|
by Lorenzo Verdoscia, Roberto Vaccaro
Computing
http://alfa.irsip.na.cnr.it/~lorenzo/papers/HLDTFLMDL.ps
Add To MetaCart
Abstract:
A High Level Dataflow System. This paper presents a new dataflow graph model, where only data tokens are allowed to flow. First we introduce a High-Level Dataflow System (HLDS) to describe a formal dataflow graph model, then we present a homogeneous HLDS (hHLDS) that formally describes our proposal. In this proposal the dataflow graph is obtained by employing only actors with homogeneous I/O conditions, that is, each actor, which executes an elemental operation, is characterised by having one output and two input arcs. Even though no control tokens are allowed, i.e. no T-gate, merge, and switch actors are present in this model, it is always possible to obtain dataflow graphs, which represent any programming structure and whose behaviour is well-behaved. As homogeneous I/O conditions are a severe restriction to represent the flow of a computation and the token flow in such dataflow graphs is completely asynchronous, proof is given to guarantee their determinacy. The main advantage of this representation is that it maps directly to hardware through a one-to-one correspondence between actors of the model and Functional Units of a dataflow machine.
Citations
|
701
|
Graph Theory
– Harary
- 1971
|
|
374
|
Can Programming be Liberated from the von Neumann Style? 1979 Turing Award Lecture
– Backus
|
|
110
|
A Dataflow/von Neumann Hybrid Architecture
– Iannucci
- 1988
|
|
104
|
First version data flow procedure language
– Dennis
- 1975
|
|
99
|
Data Flow Supercomputers
– Dennis
- 1980
|
|
85
|
Graph Theory: An Algorithmic Approach
– Christofides
- 1975
|
|
48
|
Dataflow machine architecture
– Veen
- 1986
|
|
39
|
The Explicit Token Store
– Culler, Papadopoulos
- 1990
|
|
26
|
Dataflow architectures and multithreading
– Lee, Hurson
- 1994
|
|
23
|
An efficient pipelined dataflow processor architecture
– Dennis, Gao
- 1988
|
|
20
|
A Second Opinion of Data Flow Machines and Languages
– Gajski, Padua, et al.
- 1982
|
|
19
|
An Arc/%itech/ral Comparison of Dataflow Systems
– Srini
- 1986
|
|
13
|
A Code Mapping Scheme for Dataflow Software Pipelining
– Gao
- 1990
|
|
12
|
Modeling the weather with a data flow supercomputer
– Dennis, Gao, et al.
- 1984
|
|
9
|
Iterative instructions in the Manchester dataflow computer
– Bohm, Gurd
- 1990
|
|
8
|
The RMIT Data Flow Computer: A Hybrid Architecture
– Abramson, Egan
- 1990
|
|
6
|
Closure properties of interconnections of determinate systems
– Patil
- 1970
|
|
5
|
Designing Special-purpose Co-processors Using the Data-Flow Paradigm
– Mendelson, Patel, et al.
- 1991
|
|
3
|
Logic and computers
– Böhm
- 1980
|
|
3
|
The MIT data flow engineering model
– Dennis, Lim, et al.
- 1983
|
|
3
|
Dataflow Computation - Control Flow and Data Flow: Concepts of Distributed Programming
– Dennis
- 1985
|
|
3
|
ALFA: a Static Dataflow Architecture
– Verdoscia, Vaccaro
- 1992
|
|
3
|
Conditional and Iterative Structures Using a Homogeneous Static Dataflow Graph Model
– Verdoscia, Vaccaro
- 1994
|
|
2
|
Graph Theory in Operations Research
– Boffey
- 1982
|
|
2
|
Reducing recursion to iteration by means of pairs and n-tuples
– Böhm
- 1988
|
|
2
|
A Formal Definition of Data Flow Graph Models
– P
- 1986
|
|
2
|
The data-driven microprocessor
– Komori, Shima, et al.
- 1989
|
|
2
|
Stream Languages and Data-Flow
– Skillicon
- 1991
|
|
2
|
A design philosopy of a data-driven processor
– Terada
- 1988
|
|
2
|
A Specialized Hardware to Implement in Fine Grain Mode the Dataflow Paradigm
– Vaccaro
|
|
2
|
Actor Hardware Design for a Static Dataflow Model 2nd Int'l
– Verdoscia, Vaccaro
- 1994
|
|
1
|
Reducing Recursion to Iteration by Algebraic Extention", ESOP86
– Bohm
|
|
1
|
ALFA fine grain dataflow machine
– Verdoscia
- 1996
|
