Efficiency analysis of parallel swarm intelligence using rapid range search in Euclidean space
Сохранить в:
| Опубликовано в:: | International Journal of Electronics and Telecommunications vol. 71, no. 1 (2025), p. 31 |
|---|---|
| Главный автор: | |
| Другие авторы: | , |
| Опубликовано: |
Polish Academy of Sciences
|
| Предметы: | |
| Online-ссылка: | Citation/Abstract Full Text - PDF |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|
| Краткий обзор: | Swarm intelligence algorithms are widely recognized for their efficiency in solving complex optimization problems. However, their scalability poses challenges, particularly with large problem instances. This study investigates the time performance of swarm intelligence algorithms by leveraging parallel computing on both central processing units (CPUs) and graphics processing units (GPUs). The focus is on optimizing algorithms designed for range search in Euclidean space to enhance GPU execution. Additionally, the study explores swarm-inspired solutions specifically tailored for GPU implementations, emphasising improving efficiency in video rendering and computer simulations. The findings highlight the potential of GPU-accelerated swarm intelligence solutions to address scalability challenges in large-scale optimization, offering promising advancements in the field. |
|---|---|
| ISSN: | 2081-8491 2300-1933 0035-9386 0867-6747 |
| DOI: | 10.24425/ijet.2025.153541 |
| Источник: | Advanced Technologies & Aerospace Database |