|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Approach to Similarity-based Performance Analysis of Supercomputer Computational Jobsстатья
Статья опубликована в журнале из списка RSCI Web of Science
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из перечня ВАК
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 23 января 2026 г.
- Авторы: Paokin A.V., Nikitenko D.A.
- Журнал: Lobachevskii Journal of Mathematics
- Том: 46
- Номер: 8
- Год издания: 2025
- Издательство: Kazanskii Gosudarstvennyi Universitet/Kazan State University
- Местоположение издательства: Russian Federation
- Первая страница: 3767
- Последняя страница: 3776
- DOI: 10.1134/S1995080225608902
- Аннотация: A supercomputer is an expensive, in-demand resource. It is often organized as a cluster,where computational resources are managed by a scheduler and the time to obtain a result consists of two components: the time a job spends waiting in the queue and the time it takes to execute. On the one hand, a supercomputer application must efficiently utilize computational resources duringexecution. On the other hand, it is necessary to optimally select launch parameters, which affect both the waiting time in the queue and the execution time.This study proposes a lightweight approach for computational job analysis through the simultaneous consideration of multiple groups of computational jobs. Groups of jobs that are potentially of interest to a user are formed in collaboration with the user, and these groups can be gradually narrowed for further analysis.
- Добавил в систему: Паокин Андрей Викторович