
Tail Recursion Transformation in Functional Dataflow Parallel Programs
Author(s) -
A. I. Legalov,
O. V. Nepomnyaschy,
I. V. Matkovsky,
Mariya S. Kropacheva
Publication year - 2015
Publication title -
modelirovanie i analiz informacionnyh sistem
Language(s) - English
Resource type - Journals
eISSN - 2313-5417
pISSN - 1818-1015
DOI - 10.18255/1818-1015-2012-4-48-58
Subject(s) - dataflow , computer science , parallel computing , asynchronous communication , dataflow architecture , parallelism (grammar) , recursion (computer science) , program transformation , transformation (genetics) , functional programming , pace , data flow diagram , programming language , computer network , biochemistry , chemistry , database , gene , geodesy , geography
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.