flow-based programming
≈ 3 min read
Names in other languages
- EspañolProgramación basada en flujo
- УкраїнськаПрограмування потоком даних
- Englishflow-based programming
- eoflubaza programado
- 日本語フローベースプログラミング
- 繁體中文基於流程式設計
- 中文基于流编程
- 简体中文基于流编程
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computer programming, flow-based programming (FBP) is a programming paradigm that defines applications as networks of black box processes, which exchange data across predefined connections by message passing, where the connections are specified externally to the processes. These black box processes can be reconnected endlessly to form different applications without having to be changed internally. FBP is thus naturally component-oriented. FBP is a particular form of dataflow programming based on bounded buffers, information packets with defined lifetimes, named ports, and separate definition of connections.
In computer programming, flow-based programming (FBP) is a programming paradigm that defines applications as networks of black box processes, which exchange data across predefined connections by message passing, where the connections are specified externally to the processes. These black box processes can be reconnected endlessly to form different applications without having to be changed internally. FBP is thus naturally component-oriented. FBP is a particular form of dataflow programming based on bounded buffers, information packets with defined lifetimes, named ports, and separate definition of connections. c = G(F(a),F(b)); Just as in functional notation F can be used twice because it only works with values, and therefore has no side effects, in FBP two instances of a given component may be running concurrently with each other, and therefore FBP components must not have side-effects either. Functional notation could clearly be used to represent at least a part of an FBP network. The question then arises whether FBP components can themselves be expressed using functional notation. W.H. Burge showed how stream expressions can be developed using a recursive, applicative style of programming, but this work was in terms of (streams of) atomic values. In FBP, it is necessary to be able to describe and process structured data chunks (FBP IPs). Furthermore, most applicative systems assume that all the data is available in memory at the same time, whereas FBP applications need to be able to process long-running streams of data while still using finite resources. Friedman and Wise suggested a way to do this by adding the concept of "lazy cons" to Burge's work. This removed the requirement that both of the arguments of "cons" be available at the same instant of time. "Lazy cons" does not actually build a stream until both of its arguments are realized - before that it simply records a "promise" to do this. This allows a stream to be dynamically realized from the front, but with an unrealized back end. The end of the stream stays unrealized until the very end of the process, while the beginning is an ever-lengthening sequence of items.
See also
Active objects – Symbian#Symbian C++ Actor model Apache NiFi Binary Modular Dataflow Machine (BMDFM) Communicating sequential processes (CSP) Concurrent computing Dataflow Data-flow diagram Dataflow programming IEC 61131: Function Block Diagram (FBD) – a programming language in the IEC 61131 standard Functional reactive programming Linda (coordination language) Low-code development platform MapReduce Node-RED Pipeline (software) Wayne Stevens (software engineer) XProc Yahoo Pipes
Text derived from https://en.wikipedia.org/w/index.php?oldid=1344564474 under CC BY-SA 4.0; modifications have been made.