Explain dataflow computing, Computer Engineering

Assignment Help:

DATAFLOW COMPUTING

A substitute to the Von Neumann model of calculation is dataflow computation model. In the dataflow model, control is tied to flow of data. Order of instructions in the program not plays any role on execution order. Execution of an instruction may take place when all the data needed by an instruction are available. Data is in continuing flow independent of reusable memory cells in addition its availability begins execution. Because, data is obtainable for various instructions at same time, these instructions are able to be executed in parallel. 

For the reason of using parallelism in calculation, Data Flow Graph notation is used to signify computations. In data flow graph, nodes represent commands of the program as well as edges represent data dependency among instructions.  As an example, the dataflow graph for instruction z = w × (x + y) is shown in Figure below

 

1838_Explain dataflow computing.png

Figure: DFG for z = w × (x+y)

Data moves on edges of the graph in form of data tokens that comprise data values and status information. The asynchronous parallel calculation is determined by the firing rule that is expressed by means of tokens: a node of DFG can fire if there is a token on every of its input edges. If node fires then it consumes the input tokens, executes the connected operation and places result tokens on output edge. Graph nodes may be single instructions or tasks comprising multiple instructions. The benefit of the dataflow concept is that nodes of DFG may be self scheduled. Though, the hardware maintains to identify the availability of important data is much more complicated than von Neumann model. The Illustration of dataflow computer comprises MIT Tagged Token Data Flow architecture and Manchester Data Flow Machine.


Related Discussions:- Explain dataflow computing

Explain about integrated circuit, Q. Explain about integrated circuit? ...

Q. Explain about integrated circuit? An integrated circuit is created on a thin wafer of silicon that is splitted into a matrix of small areas (size of the order of a few m.m.

Convert integer into numerical equivalents, Convert the following integers ...

Convert the following integers into their numerical equivalents in the indicated bases. Be sure to use the correct number of significant figures for each case and show how the corr

Explain star topology, Explain Star topology. A network utilizes a star...

Explain Star topology. A network utilizes a star topology if each computer attach to a central point. The following figure demonstrates the concept: Star Topology

Design a half adder, Q. Design a half adder? In half adder inputs are: ...

Q. Design a half adder? In half adder inputs are: The augend let's say 'x' and addend 'y' bits. The outputs are sum 'S' and carry 'C' bits. Logical relationship betwee

Node at the highest level in the structure, Node at the highest level in th...

Node at the highest level in the structure is known as?? Root.

..binary tree, draw a binary tree from its inorder and preorder traversal s...

draw a binary tree from its inorder and preorder traversal sequences given as follows: inorder: d b g e h a c n f preorder: a b d e g h c f n

Obstacles to is implementation - information system, Obstacles to IS implem...

Obstacles to IS implementation While information systems are now becoming the norm in most organisations the journey to this point has been a difficult one. Even in the 21st c

Expression for boolean function in standard POSform, Write the expression f...

Write the expression for Boolean function for F (A, B, C) = ∑m (1,4,5,6,7) in standard POS form.                                   Ans: f (A,B,C )= ΣM (1,4,5,6,7) in standard POS

Explain fixed arithmetic pipelines, Fixed Arithmetic pipelines We take ...

Fixed Arithmetic pipelines We take the illustration of multiplication of fixed numbers. Two fixed point numerals are added by ALU (Arithmetic and logic unit) using shift and ad

Explain bitwise operator, Bitwise Operators Like  other  operators  bit...

Bitwise Operators Like  other  operators  bitwise  operators  have  rules  of  precedence  and  associativity  that determine how expressions involved them are evaluated.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd