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

Efficiency - metrics for performance evaluation, Q. Efficiency - Metrics fo...

Q. Efficiency - Metrics for performance evaluation? The other significant metric employed for performance measurement is efficiency of parallel computer system it implies that

Give the organization of centralized store program control, Give the organi...

Give the organization of centralized store program control ( SPC). Within stored program control systems, a program or set of instructions for the computer that is stored in

What is the difference between wire and register, What is the difference be...

What is the difference between wire and reg Wire Wire is used for designing combinational logic, as we all know that this type of logic cannot store a value.  As  you  can

Design issues of multi-threaded processors, Q. Design issues of Multi-threa...

Q. Design issues of Multi-threaded processors? To accomplish the maximum processor utilization in a multithreaded architecture, the subsequent design issues should be addressed

Sets and bags, Task: Sets and bags In mathematics, the notion of multis...

Task: Sets and bags In mathematics, the notion of multiset (or bag) is a generalisation of the notion of set. A bag is a special kind of container in which the items may be

Show the advantages of joint application development, Q. Show the advantage...

Q. Show the advantages of Joint Application Development? The following are the numerous advantages of Joint Application Development: Actively includes management and use

First order logic, "George has a dog called Ernie, which is a trained Labra...

"George has a dog called Ernie, which is a trained Labrador. Trained Labradors and poodles are obedient, and all obedient dogs are good dogs. All good dogs that have a master will

Explain why the ROM is a volatile memory, Is the ROM a volatile memory? Exp...

Is the ROM a volatile memory? Explain Ans. No, ROM is a Non-Volatile memory. Programming of ROM includes making of the needed  interconnections at  the time of fabrication and

Function makestk-predicate function emptystk, 1. Create the following ADTs....

1. Create the following ADTs. (a) Write the constructor function makestk, predicate function emptystk and mutator functions pushstk and popstk: i. makestk returns a new stack

Example of the horizon problem, Example of the horizon problem: It is ...

Example of the horizon problem: It is also worth bearing in mind the horizon problem, however a game-playing agent cannot see much far satisfactory into the search space. Now

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