mlsanityData to 7 Oct 2026

Enhancing Kubernetes Automated Scheduling with Deep Learning and Reinforcement Techniques for Large-Scale Cloud Computing Optimization

arXiv 2403.07905 ↗First posted 26 Feb 2024cs.DC cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

With the continuous expansion of the scale of cloud computing applications, artificial intelligence technologies such as Deep Learning and Reinforcement Learning have gradually become the key tools to solve the automated task scheduling of large-scale cloud computing systems. Aiming at the complexity and real-time requirement of task scheduling in large-scale cloud computing system, this paper proposes an automatic task scheduling scheme based on deep learning and reinforcement learning. Firstly, the deep learning technology is used to monitor and predict the parameters in the cloud computing system in real time to obtain the system status information. Then, combined with reinforcement learning algorithm, the task scheduling strategy is dynamically adjusted according to the real-time system state and task characteristics to achieve the optimal utilization of system resources and the maximum of task execution efficiency. This paper verifies the effectiveness and performance advantages of the proposed scheme in experiments, and proves the potential and application prospect of deep learning and reinforcement learning in automatic task scheduling in large-scale cloud computing systems.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 2 of its 9 references that are in the map. First posted on arXiv 26 Feb 2024.

Builds on

2 of 9 references.

References · 2

  1. 2023Integration and Performance Analysis of Artificial Intelligence and Computer Vision Based on Deep Learning Algorithmscited by 19
  2. 2024Semantic Similarity Matching for Patent Documents Using Ensemble BERT-related Model and Novel Text Processing Methodcited by 18

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.