Tail Recursion Transformation in Functional Dataflow Parallel Programs

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...

Full description

Saved in:
Bibliographic Details
Main Authors: A. I. Legalov, O. V. Nepomnyaschy, I. V. Matkovsky, M. S. Kropacheva
Format: Article
Language:English
Published: Yaroslavl State University 2015-02-01
Series:Моделирование и анализ информационных систем
Subjects:
Online Access:https://www.mais-journal.ru/jour/article/view/40
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849338779252293632
author A. I. Legalov
O. V. Nepomnyaschy
I. V. Matkovsky
M. S. Kropacheva
author_facet A. I. Legalov
O. V. Nepomnyaschy
I. V. Matkovsky
M. S. Kropacheva
author_sort A. I. Legalov
collection DOAJ
description 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.
format Article
id doaj-art-6e8abfe29f5141be87e4db9e79276fba
institution Kabale University
issn 1818-1015
2313-5417
language English
publishDate 2015-02-01
publisher Yaroslavl State University
record_format Article
series Моделирование и анализ информационных систем
spelling doaj-art-6e8abfe29f5141be87e4db9e79276fba2025-08-20T03:44:18ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172015-02-01194485810.18255/1818-1015-2012-4-48-5834Tail Recursion Transformation in Functional Dataflow Parallel ProgramsA. I. Legalov0O. V. Nepomnyaschy1I. V. Matkovsky2M. S. Kropacheva3Сибирский федеральный университетСибирский федеральный университетСибирский федеральный университетСибирский федеральный университет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.https://www.mais-journal.ru/jour/article/view/40functional dataflow parallel programmingtail recursionprograms transformationpifagor programming language
spellingShingle A. I. Legalov
O. V. Nepomnyaschy
I. V. Matkovsky
M. S. Kropacheva
Tail Recursion Transformation in Functional Dataflow Parallel Programs
Моделирование и анализ информационных систем
functional dataflow parallel programming
tail recursion
programs transformation
pifagor programming language
title Tail Recursion Transformation in Functional Dataflow Parallel Programs
title_full Tail Recursion Transformation in Functional Dataflow Parallel Programs
title_fullStr Tail Recursion Transformation in Functional Dataflow Parallel Programs
title_full_unstemmed Tail Recursion Transformation in Functional Dataflow Parallel Programs
title_short Tail Recursion Transformation in Functional Dataflow Parallel Programs
title_sort tail recursion transformation in functional dataflow parallel programs
topic functional dataflow parallel programming
tail recursion
programs transformation
pifagor programming language
url https://www.mais-journal.ru/jour/article/view/40
work_keys_str_mv AT ailegalov tailrecursiontransformationinfunctionaldataflowparallelprograms
AT ovnepomnyaschy tailrecursiontransformationinfunctionaldataflowparallelprograms
AT ivmatkovsky tailrecursiontransformationinfunctionaldataflowparallelprograms
AT mskropacheva tailrecursiontransformationinfunctionaldataflowparallelprograms