Container Scheduling Algorithms for Distributed Cloud Environments

Abstract

Due to the difficulty of existing container scheduling algorithms to adapt to large-scale complex scenarios and meet the diverse application and load requirements, this study delves into a groundbreaking hybrid scheduling approach that melds Deep Deterministic Policy Gradient (DDPG) with a Genetic Algorithm (GA). The proposed method initially employs a container grouping policy to reduce the overhead associated with frequent inter-container calls. Subsequently, to address the computational inefficiency of large-scale scheduling, a genetic algorithm is utilized for rapid global optimization. To overcome the problem of genetic algorithms being highly susceptible to falling into local optimality, the DDPG algorithm is applied for local optimization, with a cross-mutation operation introduced to escape local optima. The experimental outcomes demonstrate that the proposed algorithm enhances cluster load balancing by 81.13%, improves the fitness function by 3.26%, reduces completion time by 19.06%, and decreases container dependency overhead by 2.75%. Furthermore, under the experimental conditions, the system performs best when the group size is 10. This research offers a novel paradigm for the development of container scheduling algorithms in distributed intelligent data clouds, advancing the field of resource management in cloud computing environments.