Оптимізація паралельних алгоритмів цифрової фільтрації великих масивів даних
In the work for solving a one-dimensional digital filtering problem, a parallel algorithms with autonomous branches, in particular an algorithm with limited parallelism, which reduces the amount of duplicate calculations in branches, are considered. These algorithms are built using the pyramids me...
Збережено в:
| Дата: | 2026 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Опубліковано: |
Pidstryhach Institute for Applied Problems of Mechanics and Mathematics of NAS of Ukraine
2026
|
| Теми: | |
| Онлайн доступ: | http://journals.iapmm.lviv.ua/ojs/index.php/APMM/article/view/3660 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Prykladni Problemy Mekhaniky i Matematyky |
Репозитарії
Prykladni Problemy Mekhaniky i Matematyky| Резюме: | In the work for solving a one-dimensional digital filtering problem, a parallel algorithms with autonomous branches, in particular an algorithm 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 memory, 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/3660 |