A HIGH-LEVEL DATA-FLOW 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 ho mogeneous HLDS (hHLDS) that formally describes our proposal. In this p roposal the dataflow graph is obtained by employing only actors with h omogeneous I/O conditions, that is, each actor, which executes an elem ental operation, is characterised by having one output and two input a rcs. 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 toke n flow in such dataflow graphs is completely asynchronous, proof is gi ven to guarantee their determinacy,The main advantage of this represen tation is that it maps directly to hardware through a one-to-one corre spondence between actors of the model and Functional Units of a datafl ow machine.