Data Flow Diagram - Definition. Was ist Data Flow Diagram
Diclib.com
Wörterbuch ChatGPT
Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:

Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT

Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:

  • wie das Wort verwendet wird
  • Häufigkeit der Nutzung
  • es wird häufiger in mündlicher oder schriftlicher Rede verwendet
  • Wortübersetzungsoptionen
  • Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
  • Etymologie

Was (wer) ist Data Flow Diagram - definition

GRAPHICAL REPRESENTATION OF THE "FLOW" OF DATA THROUGH AN INFORMATION SYSTEM
External entity; Data Flow Diagram; Dataflow diagram; Data flow model; Physical Data Flow; Logical Data Flow; Data flow diagram
  • Data flow diagram with data storage, data flows, function and interface
  • DeMarco]] notation''

Data-flow diagram         
A data-flow diagram is a way of representing a flow of data through a process or a system (usually an information system). The DFD also provides information about the outputs and inputs of each entity and the process itself.
Data Flow Diagram         
<programming> A graphical notation used to describe how data flows between processes in a system. Data flow diagrams are an important tool of most structured analysis techniques. http://smartdraw.com/resources/centers/software/dfd.htm. (2003-05-17)
data flow         
BROAD CONCEPT IN COMPUTER SYSTEMS WITH MANY DIFFERENT MEANINGS
Data flow; Flow of data; Data-flow; Dataflows; Data flows
A data flow architecture or language performs a computation when all the operands are available. Data flow is one kind of data driven architecture, the other is demand driven. It is a technique for specifying parallel computation at a fine-grain level, usually in the form of two-dimensional graphs in which instructions that are available for concurrent execution are written alongside each other while those that must be executed in sequence are written one under the other. Data dependencies between instructions are indicated by directed arcs. Instructions do not reference memory since the data dependence arcs allow data to be transmitted directly from the producing instruction to the consuming one. Data flow schemes differ chiefly in the way that they handle re-entrant code. Static schemes disallow it, dynamic schemes use either "code copying" or "tagging" at every point of reentry. An example of a data flow architecture is MIT's VAL machine.

Wikipedia

Data-flow diagram

A data-flow diagram is a way of representing a flow of data through a process or a system (usually an information system). The DFD also provides information about the outputs and inputs of each entity and the process itself. A data-flow diagram has no control flowthere are no decision rules and no loops. Specific operations based on the data can be represented by a flowchart.

There are several notations for displaying data-flow diagrams. The notation presented above was described in 1979 by Tom DeMarco as part of structured analysis.

For each data flow, at least one of the endpoints (source and / or destination) must exist in a process. The refined representation of a process can be done in another data-flow diagram, which subdivides this process into sub-processes.

The data-flow diagram is a tool that is part of structured analysis and data modeling. When using UML, the activity diagram typically takes over the role of the data-flow diagram. A special form of data-flow plan is a site-oriented data-flow plan.

Data-flow diagrams can be regarded as inverted Petri nets, because places in such networks correspond to the semantics of data memories. Analogously, the semantics of transitions from Petri nets and data flows and functions from data-flow diagrams should be considered equivalent.