|
ИСТИНА |
Войти в систему Регистрация |
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
A Study of a Composable Approach to Parallel Programming for Many-Core Multiprocessorsстатья
- Авторы: Bakhtin Vladimir, Kataev Nikita, Kolganov Alexander, Zakharov Dmitry, Smirnov Alexander, Kocharmin Mikhail
- Сборник: Lecture Notes in Computer Science
- Год издания: 2025
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 285
- Последняя страница: 299
- DOI: 10.1007/978-3-031-78459-0_21
- Аннотация: The increase of the number of multiprocessor cores gives the great opportunity for improvement of the parallel application performance. However, the programmer faces significant challenges. The raise of the work distribution overhead and the decrease of a work portion per thread may drastically degrade the application performance. A possible solution is to compose parallelism available in application at different levels or to run different applications simultaneously. However, this approach may require extended support in parallel programming models to overcome possible oversubscription issues. In our study we examine the performance different programming models provide while they are used to exploit composable parallelism. We consider OpenMP, oneTBB and Argobots to exploit parallelism available in the NAS Parallel Benchmarks and to compose several benchmarks in different ways. We also examine multi-zone versions of the benchmarks that exploit multiple levels of parallelism. We conducted our experiments on Arm-based and x86-based systems.
- Добавил в систему: Бахтин Владимир Александрович