blob: 7f4bc220c36a13a6c86717c87302043415875822 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
+++
title = "Data-flow Graph"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["2b1", "1c2b", "1b6", "1a"]
forwardlinks = ["1a2"]
zettelid = "1a1"
+++
The data-flow graph (DFG) is a great representation for code that should
eventually become a circuit \[1\], because it builds data relationships
between the assignments instead of control low dependencies between
them. This removes the ordering that was imposed by the initial writing
of the code, as the inherent parallelism of hardware means that
independent instructions can execute in parallel.
Control flow is important for the CPU, as it is inherently single
threaded. Using multiple threads for only a couple of instructions is
not feasible, in addition to that.
<div id="refs" class="references csl-bib-body" markdown="1">
<div id="ref-hauck10_recon" class="csl-entry" markdown="1">
<span class="csl-left-margin">\[1\]
</span><span class="csl-right-inline">S. Hauck and A. DeHon,
*Reconfigurable computing: The theory and practice of FPGA-based
computation*. Elsevier, 2010.</span>
</div>
</div>
|
