Abstract
The peculiarities of transforming functional dataflow parallel programs into programs with finite resources are analysed. It is considered how these transformations are affected by the usage of asynchronous lists, the return of delayed lists and the variation of the data arrival pace relative to the time of its processing. These transformations allow us to generate multiple programs with static parallelism based on one and the same functional dataflow parallel program.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Legalov, A.I., The functional programming language for creating architecture-independent parallel programs, Computational Technologies, vol. 10, no 1, pp. 71–89; Novosibirsk: Institute of Computational Technologies SB HAS, 2005.
Udalova, U.V., Legalov, A.I., and Sirotinina, N.U., Debug and verification of function-stream parallel programs, Journal of Siberian Federal University. Engineering and Technologies, 2011, vol. 4, no. 2, pp. 213–224.
Redkin, A.V. and Leglaov A.I., Event-based control of computations for functional-dataflow programming, Scientific Bulletin of Novosibirsk State Technical University, 2008, vol. 32, no. 3, pp. 111–120.
Leglaov, A.I. and Redkin, A.V., Expansion of asynchronous control using data readiness, The Third International Conference on Parallel Computations and Control Problems (PACO’2006), ISBN 5-201-14990-1, 2006, pp. 1272–1281.
Author information
Authors and Affiliations
Corresponding author
Additional information
The article is published in the original.
About this article
Cite this article
Legalov, A.I., Nepomnyaschy, O.V., Matkovsky, I.V. et al. Tail recursion transformation in functional dataflow parallel programs. Aut. Control Comp. Sci. 47, 366–372 (2013). https://doi.org/10.3103/S0146411613070237
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411613070237