The Manchester prototype dataflow computer
Communications of the ACM - Special section on computer architecture
Performance evaluation of a simulated data-flow computer with low-resolution act
Journal of Parallel and Distributed Computing
Structure of Computers and Computations
Structure of Computers and Computations
First version of a data flow procedure language
Programming Symposium, Proceedings Colloque sur la Programmation
Implementing streams on a data flow computer system with paged memory
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Resource management in dataflow
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A STRUCTURE MEMORY FOR DATA FLOW COMPUTERS
A STRUCTURE MEMORY FOR DATA FLOW COMPUTERS
Language features for a static data flow environment
Language features for a static data flow environment
LISP 1.5 Programmer's Manual
Performance of a Simulated Dataflow Computer
IEEE Transactions on Computers
A Practical Data Flow Computer
Computer
Computer
ACM Computing Surveys (CSUR)
A tagged token dataflow machine for computing small, iterative algorithms
ACM SIGARCH Computer Architecture News
Solving partial differential equations in a data-driven multiprocessor environment
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Token Relabeling in a Tagged Token Data-Flow Architecture
IEEE Transactions on Computers
Data-Driven Parallel Production Systems
IEEE Transactions on Software Engineering
A scheme to extract run-time parallelism form sequential loops
ICS '91 Proceedings of the 5th international conference on Supercomputing
Executing DSP Applications in a Fine-Grained Dataflow Environment
IEEE Transactions on Software Engineering
A model for dataflow based vector execution
ICS '94 Proceedings of the 8th international conference on Supercomputing
Enhancing Functional and Irregular Parallelism: Stateful Functions and their Semantics
International Journal of Parallel Programming
A Hybrid Scheme for Processing Data Structures in a Dataflow Environment
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An eclectic 5th generation architecture for ultra high speed computing
ACM SIGART Bulletin
| Hi-index | 0.00 |
Data-flow languages have been hailed as the solution to the programmability of general-purpose multiprocessors. However, data-flow semantics introduce constructs that lead to much overhead at compilation, allocation, and execution time. Indeed, due to its functionality, the data-flow model of computation does not handle repetitive program constructs very efficiently. This is due to the fact that the cornerstone of data flow, namely the concept of single assignment, is opposed to the idea of reexecution of a portion of program as in a loop. A corollary of this problem is the effective representation, storage, and processing of data structures, as these will most often be used in loops. In this paper, various aspects of this issue are explailned in detail. Several solutions that have been put forward in the current literature are then surveyed and analyzed. In order to offset some of the disadvantages presented by these, we introduce new methods for handling arrays. In the first one, we raise the level of computation to that of arrays for more efficient operation. In the two others, the opposite approach is taken, and the notion of array is done away with entirely at the execution level in order to take advantage of the data-flow semantics at their best logical level of performance.