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...
Saved in:
| 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!
|
Similar Items
-
Formal Verification of Programs in Functional Dataflow Parallel Language
by: M. S. Kropacheva, et al.
Published: (2015-03-01) -
Verification of Programs with Mutual Recursion in the Pifagor Language
by: Mariya S. Ushakov, et al.
Published: (2018-08-01) -
The System for Transforming the Code of Dataflow Programs into Imperative
by: Vladimir S. Vasilev, et al.
Published: (2021-06-01) -
Methods for Change Parallelism in Process of High-level VLSI Synthesis
by: Igor Nikolaevich Ryzhenko, et al.
Published: (2022-03-01) -
Automation of Formal Verification of Programs in the Pifagor Language
by: M. S. Ushakova, et al.
Published: (2015-08-01)