Dataflow Programming Pattern: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "** ..." to "** …") |
||
| Line 6: | Line 6: | ||
** [[Flow-Based Programming]]. | ** [[Flow-Based Programming]]. | ||
** [[Reactive Programming Pattern]]. | ** [[Reactive Programming Pattern]]. | ||
** | ** … | ||
* <B>See:</B> [[Directed Graph]], [[Dataflow]], [[Programming Language]], [[Functional Language]], [[Dataflow Architecture]]. | * <B>See:</B> [[Directed Graph]], [[Dataflow]], [[Programming Language]], [[Functional Language]], [[Dataflow Architecture]]. | ||
Latest revision as of 16:38, 6 January 2023
A Dataflow Programming Pattern is a programming pattern that models a program as a directed graph of the data flowing between operations, thus implementing dataflow principles and architecture.
- Context:
- It can be supported by a Dataflow Programming Language.
- …
- Example(s):
- See: Directed Graph, Dataflow, Programming Language, Functional Language, Dataflow Architecture.
References
2021
- (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/dataflow_programming Retrieved:2021-2-23.
- In computer programming, dataflow programming is a programming paradigm that models a program as a directed graph of the data flowing between operations, thus implementing dataflow principles and architecture. Dataflow programming languages share some features of functional languages, and were generally developed in order to bring some functional concepts to a language more suitable for numeric processing. Some authors use the term datastream instead of dataflow to avoid confusion with dataflow computing or dataflow architecture, based on an indeterministic machine paradigm. Dataflow programming was pioneered by Jack Dennis and his graduate students at MIT in the 1960s.