RUS  ENG
Full version
JOURNALS // Computing, Telecommunication and Control // Archive

Computing, Telecommunication and Control, 2024 Volume 17, Issue 3, Pages 42–53 (Mi ntitu367)

Applied problem solving with machine learning

Count time series analysis of jobs scheduling in the hybrid supercomputer center

S. V. Malov, A. A. Lukashin

Peter the Great St. Petersburg Polytechnic University

Abstract: Increasing the efficiency of supercomputer centers is an extremely important task, especially in the context of growing demand for high-performance computing and a shortage of supercomputer resources. Statistical analysis of the results of various indicators of supercomputer performance is aimed at creating models of computing resource management and forming a basis for using artificial intelligence methods. The purpose of this research is to study the incoming flow of user requests (jobs), which largely determines the load on supercomputer resources. To analyze the incoming flow of user jobs, generalized linear models and generalized estimating equations, as well as the autoregressive conditional Poisson model, were used. It allowed taking into account the dependence of observations and the effect of overdispersion. Based on the results of supercomputer operation observations, estimates of the time trend were obtained, as well as indicators of changes in the intensity of the job flow within weekly and annual cycles with classification by areas of expertise and computing clusters. Indicators of statistical significance of changes within the weekly and annual cycles were established. As a result of an advanced statistical analysis using multiple comparison methods, statistically significant orders of the main effects of the weekly and annual factors were obtained.

Keywords: count time series, generalized estimating equations, autoregressive conditional Poisson model, multiple comparisons, supercomputer cluster, job scheduling.

UDC: 519.25

Received: 25.06.2024

Language: English

DOI: 10.18721/JCSTCS.17304



© Steklov Math. Inst. of RAS, 2026