Tail Recursion Transformation in Functional Dataflow Parallel Programs

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

• функционально-потоковое параллельное программирование
• хвостовая рекурсия
• преобразование программ
• язык программирования Пифагор