Сибирский федеральный университет

Тип публикации: статья из журнала

Год издания: 2013

Идентификатор DOI: 10.3103/S0146411613070237

Ключевые слова: Functional dataflow parallel programming, Pifagor programming language, Programs transformation, Tail recursion

Аннотация: 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 same functional dataflow parallel program. © Allerton Press, Inc., 2013.

Журнал: Automatic Control and Computer Sciences

Выпуск журнала: Vol. 47, Is. 7

Номера страниц: 366-372

• Legalov A.I. (Siberian Federal University)
• Nepomnyaschy O.V. (Siberian Federal University)
• Matkovsky I.V. (Siberian Federal University)
• Kropacheva M.S. (Siberian Federal University)

• Scopus
• Ядро РИНЦ (eLIBRARY.RU)
• Список ВАК