Approbation of Methods for Supercomputer Job Queue Wait Time Estimation

Users, while developing and executing their applications, can choose from several supercomputer systems to get computation results. This choice is influenced by many factors, and the wait time before application execution is among them, because users can not immediately get the required resources wh...

Full description

Saved in:
Bibliographic Details
Published inLobachevskii journal of mathematics Vol. 44; no. 8; pp. 3140 - 3147
Main Authors Paokin, A. V., Nikitenko, D. A.
Format Journal Article
LanguageEnglish
Published Moscow Pleiades Publishing 01.08.2023
Springer Nature B.V
Subjects
Algebra
Algorithms
Analysis
Geometry
Mathematical Logic and Foundations
Mathematics
Mathematics and Statistics
Probability Theory and Stochastic Processes
Queues
Supercomputers
User requirements
supercomputer
HPC
resource managers
time to result
classification
job queues
Online AccessGet full text

Cover

More Information
Summary:Users, while developing and executing their applications, can choose from several supercomputer systems to get computation results. This choice is influenced by many factors, and the wait time before application execution is among them, because users can not immediately get the required resources which are allocated for computing the results of other users’ computational jobs. Special software, called schedulers, is used to manage and share resources. Although schedulers use fixed algorithms for this task, the queue wait time is often difficult to estimate, because of the lack of information about jobs and future events. In this research, different methods of job queue wait time estimation are compared, some algorithms are modified and evaluated, using execution logs of the ‘‘Lomonosov-2’’ supercomputer.
ISSN:1995-0802
1818-9962
DOI:10.1134/S1995080223080437