Container Scheduling Algorithms for Distributed Cloud Environments

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.

Authors

Institutions

Publication Details

Journal
Processes
Published
2024-08-25
DOI
https://doi.org/10.3390/pr12091804
Citations
4
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
3.12
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Container Scheduling Algorithms for Distributed Cloud Environments

Cong Shen, Xinyuan Qiu, Chuanqi Cheng, H. Chen
4 citations
Processes
Cloud Computing and Resource Management
3.12
article

Container Scheduling Algorithms for Distributed Cloud Environments

Cong Shen, Xinyuan Qiu, Chuanqi Cheng, H. Chen
article en
4 citations

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.

ProcessesVol. 12(9)
Xidian University (CN), Xi’an University (CN)
Decent work and economic growth
Openalex Percentile: Top 7%
Cloud Computing and Resource Management
3.12
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.