|
Modelirovanie i Analiz Informatsionnykh Sistem, 2012, Volume 19, Number 4, Pages 48–58
(Mi mais244)
|
|
|
|
Tail Recursion Transformation in Functional Dataflow Parallel Programs
A. I. Legalov, O. V. Nepomnyaschy, I. V. Matkovsky, M. S. Kropacheva Siberian Federal University, Krasnoyarsk
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 some functional dataflow parallel program.
Keywords:
functional dataflow parallel programming, tail recursion, programs transformation, Pifagor programming language.
Received: 22.04.2012
Citation:
A. I. Legalov, O. V. Nepomnyaschy, I. V. Matkovsky, M. S. Kropacheva, “Tail Recursion Transformation in Functional Dataflow Parallel Programs”, Model. Anal. Inform. Sist., 19:4 (2012), 48–58
Linking options:
https://www.mathnet.ru/eng/mais244 https://www.mathnet.ru/eng/mais/v19/i4/p48
|
Statistics & downloads: |
Abstract page: | 223 | Full-text PDF : | 109 | References: | 41 |
|