Data flow mechanism


  • In data flow mechanism, the running of an instruction is determined by data availability instead of being guided by program counter.
  • In theory any instruction should be ready for execution whenever operands become available.
  • The instructions in data driven program are not ordered in any way.
  • Instead of being stored in shared memory, data are directly held inside instructions.
  • Computational results are passed directly between instructions.
  • The data generated by instruction will be duplicated into many copies and forwarded directly to all needy instructions.
  • This data driven scheme requires no shared memory, no program counter and no control sequencer.

However it requires special method to detect data availability, to match data tokens with needy instructions and to enable the chain reaction of asynchronous instructions execution. 


There are mainly two sort of computers. Data flow computers are connectional computer based on Von Neumann machine. It carry out instructions under program flow control whereas control flow computer, executes instructions under availability of data.  

More topics from ACA to read:

ACA: ADVANCED COMPUTER ARCHITECTURE covered following topics in Advanced Computer Architecture.

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages covered following topics in these notes.

Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming


    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.