A Computation Model with Data Flow Sequencing

摘要

A computation model is described in which the sequencing control is governed by the flow of the data. The directed graph has been used to represent the computations. The nodes of the graph represent computation steps and the edges represent first-in first-out queues of data. The model is actually a framework within which various classes of computations may be expressed. A set of data types and a set of primitive nodes define a particular class of computations. The data types allow structured data to be used in the computations while the primitive nodes form a set of well-defined functions from which all other functions must be composed. A graph procedure is defined recursively, thus allowing programs to be written in a hierarchical manner. (Author)