Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
What are program flow mechanisms?
Traditional computers are founded on a control flow structure by which the series of program implementation is particularly established in the user program. Data flow computers have a high degree of parallelism at the fine-grain instruction-level reduction computers are based on a demand-driven method which commences operation based on the demand for its result by other computations.
Data flow & control flow computers − There are mainly two sorts of computers as data flow computers are connectional computers depends on the Von Neumann machine. It transfers out instructions under program flow control whereas the control flow computer implements instructions under the availability of information.
Control flow Computers − Control Flow computers occupy shared memory to influence program instructions and data objects. Variables in shared memory are upgraded by some instructions.
The implementation of one instruction can create side effects on various instructions because memory is shared. In few cases, the side effects avoids parallel processing from taking place. A uniprocessor computer is genetically sequential because of the use of a control-driven structure.
Data Flow Computers − In a data flow computer, the running of instruction is determined by data availability rather than being directed by a program counter. In this concept, any instruction must be ready for implementation whenever operands turn available.
The instructions in a data-driven program are not controlled in some way. Rather than being saved in shared memory, information is precisely held inside instructions.
Computational results are transferred directly between instructions. The information created by instruction will be replicated into multiple copies and forwarded directly to all needy instructions.
This data-driven design needed no shared memory, no program counter, and no control sequencer. It needed a special method to identify data availability, match data tokens with needy instructions, and allow the group reaction of asynchronous instructions execution.
4K+ Views
