Оптимізація паралельних алгоритмів цифрової фільтрації великих масивів даних

In the work for solving a one-dimensional digital filtering problem, a parallel algo­rithms with autonomous branches, in particular an algo­rithm with limited parallelism, which reduces the amount of duplicate calculations in branches, are considered. These algorithms are built using the pyramids me...

Full description

Saved in:
Bibliographic Details
Date:2025
Main Authors: Vdovych, R. R.; Інститут прикладних проблем механіки і математики ім. Я. С. Підстригача НАН України, Львів, Yadzhak, M. S.; Інститут прикладних проблем механіки і математики ім. Я. С. Підстригача НАН України, Львів; Львівський національний університет ім. Івана Франка, Львів
Format: Article
Published: Pidstryhach Institute for Applied Problems of Mechanics and Mathematics of NAS of Ukraine 2025
Subjects:
Online Access:http://journals.iapmm.lviv.ua/ojs/index.php/APMM/article/view/apmm2025.23.87-93
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Prykladni Problemy Mekhaniky i Matematyky

Institution

Prykladni Problemy Mekhaniky i Matematyky
Description
Summary:In the work for solving a one-dimensional digital filtering problem, a parallel algo­rithms with autonomous branches, in particular an algo­rithm with limited parallelism, which reduces the amount of duplicate calculations in branches, are considered. These algorithms are built using the pyramids method for loops parallelization. An approach to developing an algorithms with limited parallelism for shared and distributed memo­ry, in which there is no duplication of calculations on iterations in parallel branches, is proposed. Each of these algorithms are oriented towards implementation using modern software and hardware. Cite as: R. R. Vdovych, M. S. Yadzhak, “Optimization of parallel algorithms for digital  filtering of large data arrays,” Prykl. Probl. Mekh. Mat., Issue 23, 87–93 (2025) (in Ukrainian), https://doi.org/10.15407/apmm2025.23.87-93
DOI:10.15407/apmm2025.23.87-93