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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2015-02-01
|
| Series: | Modelirovanie i Analiz Informacionnyh Sistem |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/40 |
| Summary: | 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. |
|---|---|
| ISSN: | 1818-1015 2313-5417 |