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 input - output techniques, Q. Explain the Hard Disk Controller & F...

Q. Explain the Hard Disk Controller & Floppy Disk Controller with necessary diagrams. Q. Explain Input/Output Techniques (Data Transfer Techniques).

Explain about theta notation, Q. Explain about Theta Notation? Theta Θ...

Q. Explain about Theta Notation? Theta Θ Notation : The set Θ (g(n)) comprises all functions f(n) for that there exist positive constants c1,c2 such that f(n) is squeezed in b

Address translation - computer architecture, Address translation: ...

Address translation: Compiler time : If it is known in advance that a program will reside at a particular location of primary memory, and then the compiler can be told to

What is the function of an ip packet screening router, Function of an IP Pa...

Function of an IP Packet Screening Router: A screening router is the most basic type of firewall and uses only the packet filtering capability to control and monitor network tr

JAVA, HOW WAS JAVA INVENTED?

HOW WAS JAVA INVENTED?

Draw a schematic for managing dynamic storage allocation, Draw a simple sch...

Draw a simple schematic for managing dynamic storage allocation. A simple schematic for managing dynamic storage allocation is as follows: Block size pointe

The advantage of using a database management system, The advantage of using...

The advantage of using a Database Management System The advantage of using a Database Management System for a data store is that databases have mechanisms for describing data,

Explain dataflow computation model, Explain dataflow computation model ...

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 dat

What is serialization, What is serialization, how it works in .NET? Ser...

What is serialization, how it works in .NET? Serialization is when you persist the state of an object to a storage medium so an exact copy can be re-created at a later stage. S

Describe the necessary conditions for deadlock, Describe the necessary cond...

Describe the necessary conditions for Deadlock. Required conditions for deadlock 1. Mutual exclusion 2. Hold and wait 3. No preemption 4. Circular wait Mutual e

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