Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
language:langs:dflow [2020/07/08 13:02] rajit |
language:langs:dflow [2021/06/02 12:04] rajit [Examples] |
||
---|---|---|---|
Line 14: | Line 14: | ||
</ | </ | ||
- | More generally, the syntax shown above corresponds to the // | + | The dataflow language has the following primitives: |
+ | * Function: reads tokens on all of its inputs, computes some function of those inputs, and produces an output token in response; | ||
+ | * Split: conditionally routes an input token to one of its outputs; | ||
+ | * Controlled merge (a.k.a. merge): conditionally reads one of its input tokens and routes it to its output; | ||
+ | * Deterministic merge: assumes input token arrivals are mutually exclusive, and sends the input token to its output; | ||
+ | * Non-deterministic merge: same thing as deterministic merge, except input tokens are not assumed to be mutually exclusive. | ||
+ | * Initial tokens: these are specified directly in the syntax | ||
+ | * Copy: implicit, with the same channel is used for multiple inputs | ||
+ | * Sources and sinks have short-hand syntax. | ||
+ | |||
+ | ===== Function ===== | ||
+ | |||
+ | The syntax shown above corresponds to the // | ||
+ | |||
+ | ===== Split ===== | ||
The //split// dataflow element receives a control token and a data token, and uses the value of the control token to route the data token to one of the output channels. If the control token=0, the first channel is used; if it is 1, then the next channel is used; etc. The syntax for this is shown below: | The //split// dataflow element receives a control token and a data token, and uses the value of the control token to route the data token to one of the output channels. If the control token=0, the first channel is used; if it is 1, then the next channel is used; etc. The syntax for this is shown below: | ||
Line 29: | Line 43: | ||
</ | </ | ||
The '' | The '' | ||
+ | |||
+ | Splits with more than two outputs use the same syntax. The control token is assumed to take on an integer value specifying which output channel is used. | ||
+ | < | ||
+ | dataflow { | ||
+ | {c} I -> O0, O1, O2, ..., On | ||
+ | } | ||
+ | </ | ||
+ | |||
+ | ===== Controlled merge ===== | ||
The // | The // | ||
Line 36: | Line 59: | ||
} | } | ||
</ | </ | ||
- | In this example, if a 0 is received on '' | + | In this example, if a 0 is received on '' |
+ | < | ||
+ | dataflow { | ||
+ | {c} I0, I1, ..., Ik -> O | ||
+ | } | ||
+ | </ | ||
+ | |||
+ | ===== Implicit copy and explicit buffers ===== | ||
Copies are implicit, and are automatically introduced when the same channel name is used multiple times on the left hand side. In the example below, an input token is received on '' | Copies are implicit, and are automatically introduced when the same channel name is used multiple times on the left hand side. In the example below, an input token is received on '' | ||
Line 46: | Line 76: | ||
</ | </ | ||
The fact that '' | The fact that '' | ||
+ | |||
+ | In pipelined circuits, it is important to be able to introduce slack to optimize performance. The syntax for this is the following: | ||
+ | < | ||
+ | dataflow { | ||
+ | a + b -> [4] sum | ||
+ | } | ||
+ | </ | ||
+ | Here, '' | ||
+ | |||
+ | ===== Initial tokens ===== | ||
+ | |||
+ | Finally, we need to be able to introduce initial tokens with pre-specified initial values. The bracket notation is overloaded for this purpose. | ||
+ | < | ||
+ | dataflow { | ||
+ | a + b -> [4,2] sum | ||
+ | } | ||
+ | </ | ||
+ | This specifies that not only are there four pipeline stages, but the initial output produced on the '' | ||
+ | |||
+ | The description so far is a complete set of dataflow primitives and can be used to [[https:// | ||
+ | |||
+ | ===== Deterministic and non-deterministic merge ===== | ||
+ | |||
+ | There are two other primitives that are also supported, because they can be useful in certain circumstances. They are both variations of the controlled merge. The first is the // | ||
+ | < | ||
+ | dataflow { | ||
+ | {*} I0, I1 -> O | ||
+ | } | ||
+ | </ | ||
+ | The '' | ||
+ | < | ||
+ | dataflow { | ||
+ | {|} I0, I1 -> O | ||
+ | } | ||
+ | </ | ||
+ | Note that this introduces an arbiter. | ||
+ | |||
+ | Often it is helpful to know what decision was made by the arbiter. To support this, we permit an optional second channel on the right hand side of the dataflow expression as follows: | ||
+ | < | ||
+ | dataflow { | ||
+ | {|} I0, I1 -> O, c | ||
+ | } | ||
+ | </ | ||
+ | For each output generated, the control channel '' | ||
+ | |||
+ | ===== Sink ===== | ||
+ | |||
+ | A dataflow sink simply receives and discards a token from a channel. Sinks are not needed in general, since the channel that corresponds to the sink can be optimized away by an implementation. However, sinks can be useful when a particular process is re-used in a context when one of its outputs is not used. The syntax is the following: | ||
+ | < | ||
+ | dataflow { | ||
+ | c -> * | ||
+ | } | ||
+ | </ | ||
+ | The values received on '' | ||
+ | |||
+ | ====== Examples ====== | ||
+ | |||
+ | |||
+ | As a simple example, consider a multiply-accumulate block. The block can be specified as follows: | ||
+ | |||
+ | < | ||
+ | dataflow { | ||
+ | a * b -> mul; | ||
+ | x + mul -> out; | ||
+ | out ->[4,0] x | ||
+ | } | ||
+ | </ | ||
+ | The external data inputs are '' | ||
+ | |||
+ | Suppose we augment this with an external control token on '' | ||
+ | |||
+ | < | ||
+ | dataflow { | ||
+ | a * b -> mul; | ||
+ | x + mul -> out; | ||
+ | out ->[4,0] y; | ||
+ | {c} y -> yc, *; | ||
+ | {c} yc, zero -> x; | ||
+ | 0 -> zero | ||
+ | } | ||
+ | </ | ||
+ | |||
+ | ====== Clusters and Ordering ====== | ||
+ | |||
+ | It can be convenient to group dataflow elements into clusters. The syntax for grouping dataflow elements is: | ||
+ | |||
+ | < | ||
+ | dataflow { | ||
+ | ... | ||
+ | | ||
+ | a + b -> c; | ||
+ | a - b -> d | ||
+ | } | ||
+ | ... | ||
+ | } | ||
+ | </ | ||
+ | |||
+ | |||