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

Advantage and disadvantage of threaded binary trees, Advantage  1.     ...

Advantage  1.       By doing threading we neglect the recursive method of traversing a Tree , which makes use of stack and consumes many memory and time . 2.       The node

CRTscreen as a two-dimensional matrix, Explain the statement- CRT screen as...

Explain the statement- CRT screen as a two-dimensional matrix One can imagine the CRT screen as a two-dimensional matrix which has m rows and n  columns and this is usually ref

Single bus structures, Single BUS STRUCTURES : The Bus structure and ...

Single BUS STRUCTURES : The Bus structure and multiple bus structures are kinds of bus or computing. A bus is fundamentally a subsystem which transfers data amongst the compo

Define synchronization latency problem, Q. Define Synchronization Latency P...

Q. Define Synchronization Latency Problem? If two simultaneous processes are executing remote loading then it's not recognized by what time two processes will load as issuing p

Which method uses the greatest number of layers in OSI model, Which method ...

Which method uses the greatest number of layers in the OSI model? Gateway utilizes the greatest number of layers into the OSI model.

Give difference between assembler and interpreter, Give difference between ...

Give difference between assembler and interpreter. Assembler: It is the translator for an assembly language of computer. An assembly language is a low-level programming langu

Branch (control) hazards in computer architecture, Branch (control) hazards...

Branch (control) hazards in computer architecture : Branching hazards (also called control hazards) take place when the processor is told to branch -for example, if a defin

What are the requirements for a swapper to work, What are the requirements ...

What are the requirements for a swapper to work? The swapper works on the highest scheduling priority. Firstly it will look for any sleeping method, if not found then it will

Explain about karnaugh maps, Q. Explain about Karnaugh Maps? Karnaugh m...

Q. Explain about Karnaugh Maps? Karnaugh maps are a suitable way of expressing and simplifying Boolean function of 2 to 6 variables. The stepwise process for Karnaugh map is.

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