Explain dataflow computation model, Computer Engineering

Assignment Help:

Explain dataflow computation model

An option to the von Neumann model of computation is a dataflow computation model. In a dataflow model the control is tied to the flow of data. The order of commands in the program has no role in the implementation order. Computations take place when all the data items needed for beginning execution of an instruction are accessible. Data is in constant flow independent of reusable memory cells and its accessibility initiates execution. Since data may be accessible for several instructions at the same mean time, these instructions can be implemented in parallel.

The potential for parallel computation is replicated by the dataflow graph, the nodes of which are the directions of the series and the edges of which characterize data dependency between instructions. The dataflow diagram for the instruction z = w × (x+y) is:-

                                                        2013_Explain dataflow computation model.png

Data movs on the boundaries of the graph in the variety of data tokens, which include data values and status information. A asynchronous parallel computation is resolute by the firing rule, which is uttered by means of tokens: a node of DFG can shoot if there is a token on each input boundary. If a node fires, it get through the input tokens, performs the connected operation and places result tokens on the output boundary. Graph nodes can be one instructions or tasks comprising many instructions.

 


Related Discussions:- Explain dataflow computation model

In which network configuration all data/information pass, A distributed net...

A distributed network configuration in which all data/information pass through a central computer is (A)  Bus network                            (B) Star network (C)  Rin

Illustrate about packet switching, Q. Illustrate about Packet switching? ...

Q. Illustrate about Packet switching? Packet switching is used to avoid long delays in transmitting data over the network. Packet switching is a technique that limits the amoun

Which gates are called universal gates, Q. What is Gate? Explain Basic gat...

Q. What is Gate? Explain Basic gates with truth table and necessary circuits. Q. Which gates are called Universal Gates? Why? Q. Give the Dual of the rule 17. Q. Realize

What is the difference between swapping and paging, What is the difference ...

What is the difference between Swapping and Paging? Swapping: Entire process is moved from the swap device to the major memory for implementation. Process size must be less t

Example of processor arrangements, Q. Example of processor arrangements? ...

Q. Example of processor arrangements? !HPF$ PROCESSORS P (10) This initiates a group of 10 abstract processors assigning them combined name P. !HPF$ PROCESSORS Q (4, 4)

Define the concept of encapsulation of OOA, Encapsulation of OOA Encap...

Encapsulation of OOA Encapsulation separates the interface of an abstraction from its implementation. By taking the above example i.e. of a car, we can now categorize them as:

What is cyclomatic complexity, What is cyclomatic complexity? Cyclomati...

What is cyclomatic complexity? Cyclomatic complexity is a computer science metric (measurement) developed by Thomas McCabe used to generally calculate the complexity of a progr

Difference between shadow and override in programming, Overriding tell us o...

Overriding tell us only the methods, but shadowing tells us the entire element.

A graph ''g'' with ''n'' nodes is bipartite, A graph 'G' with 'n' nodes is ...

A graph 'G' with 'n' nodes is bipartite if it have  no cycle of odd length.

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