|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
The Scalability Analysis of a Parallel Tree Search Algorithmстатья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 10 июня 2020 г.
- Авторы: Kolpakov Roman, Posypkin Mikhai
- Сборник: Proceedings of 9th International Conference Optimization and Applications (OPTIMA 2018), Petrovac, Montenegro
- Серия: Communications in Computer and Information Science
- Том: 974
- Год издания: 2019
- Место издания: Springer
- Первая страница: 186
- Последняя страница: 201
- DOI: 10.1007/978-3-030-10934-9_14
- Аннотация: Increasing of the number of computational cores is a primary way of achieving high performance of contemporary supercomputers. However, developing of parallel applications capable to harness the enormous amount of cores is a challenging task. Thus, studying the scalability of parallel algorithms (the number of processors to be enlarged to accommodate the growing amount of work) is very important. In this paper we propose a parallel tree search algorithm aimed at distributed parallel computers. For this parallel algorithm we perform a theoretical analysis of its scalability and show that the achieved scalability is close to the theoretical maximum.
- Добавил в систему: Колпаков Роман Максимович