Artificial intelligence and machine learning
Research Article
Forward propagation algorithm in the dataflow paradigm
Dmitry Nikolayevich Zmejev1
, Nikolay Nikolayevich Levchenko2
, Arkady Valentinovich Klimov3
National Research Center „Kurchatov Institute“, Moscow, Russia1 |
|
2 |
|
3 |
|
Abstract. The article discusses the issue of developing and implementing the forward propagation algorithm in the dataflow paradigm. The principles of dataflow computing differ significantly from traditional control-flow computing, just as the dataflow programming paradigm differs from the imperative one. Programs created in the dataflow paradigm are initially parallel. The article provides a detailed description of the forward propagation dataflow algorithm and the program that runs on the parallel dataflow computing system "Buran". The dataflow program is compact and versatile in its code. It automatically scales to the entire system, and its program code does not contain references to library functions and is based solely on basic arithmetic operations such as addition, multiplication, and comparison.
The program is capable of processing perceptrons of any dimension without modification and recompilation of the program code. The size and structure of the processed perceptron is determined by the initial data. The experimental part of the article demonstrates the high adaptability of the dataflow program to processing large amounts of continuously incoming data. An assessment of the applicability of the dataflow computing model for solving neural network problems is given. (In Russian).
Keywords: forward propagation, parallel programming, dataflow computing model, dataflow programming paradigm, parallel dataflow computing system
MSC-2020
Acknowledgments: The work was carried out within the state assignment of NRC «Kurchatov institute»
For citation: Dmitry N. Zmejev, Nikolay N. Levchenko, Arkady V. Klimov. Forward propagation algorithm in the dataflow paradigm. Program Systems: Theory and Applications, 2025, 16:4, pp. 51–79. (In Russ.). https://psta.psiras.ru/2025/4_51-79.
Full text of article (PDF): https://psta.psiras.ru/read/psta2025_4_51-79.pdf.
The article was submitted 15.07.2025; approved after reviewing 25.08.2025; accepted for publication 25.08.2025; published online 04.09.2025.