Research on load balancing scheduling algorithm for server clusters based on dynamic resource prediction

In distributed computing systems, task scheduling is crucial for resource utilization optimized and task executed normally. This paper proposes an effective dynamic scheduling algorithm through integrating task resource prediction and real-time server monitoring. The algorithm uses a decision tree model to predict the utilization of task resources and a central node to achieve the real-time monitoring of server clusters so that it can effectively allocate tasks based on the predicted results and the monitoring data. It effectively avoids the issues caused by peak task conflicts which are system downtime, task processing volume decreased and so on. Experimental results show that the proposed algorithm can significantly reduce the average task processing time and remarkably improve the resource utilization rate of the server cluster, which prove its significant advantages of overall system performance outperforms other algorithms.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1117/12.3067067
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on load balancing scheduling algorithm for server clusters based on dynamic resource prediction

Peike Zhang, Liming Zhou, Shuo Chen, Cheng Liu et al.
Distributed and Parallel Computing Systems
article

Research on load balancing scheduling algorithm for server clusters based on dynamic resource prediction

Peike Zhang, Liming Zhou, Shuo Chen, Cheng Liu, Zhi-Yong Bai
article en

Abstract

In distributed computing systems, task scheduling is crucial for resource utilization optimized and task executed normally. This paper proposes an effective dynamic scheduling algorithm through integrating task resource prediction and real-time server monitoring. The algorithm uses a decision tree model to predict the utilization of task resources and a central node to achieve the real-time monitoring of server clusters so that it can effectively allocate tasks based on the predicted results and the monitoring data. It effectively avoids the issues caused by peak task conflicts which are system downtime, task processing volume decreased and so on. Experimental results show that the proposed algorithm can significantly reduce the average task processing time and remarkably improve the resource utilization rate of the server cluster, which prove its significant advantages of overall system performance outperforms other algorithms.

Henan University (CN), DHC Software (China) (CN)
Decent work and economic growth
Openalex Percentile: Top 90%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Research on load balancing scheduling algorithm for server clusters based on dynamic resource prediction — Peike Zhang, Liming Zhou, et al. · (2025) | TGRS Research Map | TGRS