Data flow architecture is a type of computer architecture that refers to the way data is transported in a computer. Formally, it contrasts with the von Neumann architecture or control flow architecture. Here we will discuss data flow architecture in various parts and separate the whole topic into smaller specific topics. About 15 different subtopics on data flow architecture will be discussed. Of these 15, some are data flow principles, data flow graphs, data flow languages, data flow machine types, static data flow machines, dynamic data flow machines, model of sequential execution, compilers, programs, instructions, data flow versus control flow, data flow computation model, recognition signals, Data flow processors. First let's define Dataflow. Data flow is one way to get concurrency, particularly at the lower level. Finds multiple operations that can be taken simultaneously within the evaluation of a single expression. (Addison-Wesley) Dataflow ideas have also been used to parallelize the construction of compilers for more conventional architectures. Now let's get into the subtopics and more details. The first subtopic is the sequential execution model. Sequential execution is the main feature of the von Neumann computer architecture, in which programs and data are stored in centralized memory. The concepts embodied by the classical architecture have not been directly applicable to the parallel computing domain. Most programming languages ​​evolved from von Neumann languages, designed specifically for the von Neumann architecture, so programmers were conditioned to analyze problems and write programs sequentially. (Addison-Wesley) The instructions of a program are executed in sequential order. In ancient times in the... center of the card... and boolean values ​​moved along the edges, but structured type values ​​like arrays may require more work. Finally there are functions that are widely used in functional programming but not really supported in data flow graphs. (Addison-Wesley) Now let's get into the types of Dataflow machines. There are two types of data-flowing machines: static data-flowing machines and dynamic data-flowing machines. The static dataflow machine does not allow multiple instances of the dame path to run concurrently. Uses conventional memory. There is a standard static data flow model from Dennis of MIT which states that program memory contains instruction templates that represent nodes in the data flow graph. It also contains an opcode, operand slots, and destination addresses. There are three other parts to this model. They are Update-unit, Fetch-unit and