Data Flow Computing Software Development

Authors:
J. R. McGraw
Affiliations:
University of California at Davis, Davis, CA 95616 and the Lawrence Livermore National Laboratory
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 6
Cited 0

Petri Nets

ACM Computing Surveys (CSUR)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Lucid, a nonprocedural language with iteration

Communications of the ACM
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL

VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
CLU REFERENCE MANUAL

CLU REFERENCE MANUAL
AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE

AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE

Quantified Score

Hi-index	14.98

Visualization

Abstract

Data flow computing is one of the most radical approaches for multiprocessing. A computation is represented by its data flow graph and scheduling of each operator is done at run-time when all of its operands' values are available. This paper addresses the problem of language design for a data flow environment. It briefly surveys several alternatives for a data flow language and then focuses on one specific effort: the Massachusetts Institute of Technology's VAL. This language stresses implicit concurrency. Both programmer and translator can easily identify and exploit concurrency because VAL disallows all forms of side-effects and aliasing. The paper concludes with an analysis of the language and areas of continued research. While substantial progress has been made, much remains to be done in the areas of language design, translation, and use.