K-PSO: An improved PSO-based container scheduling algorithm for big data applications |
| |
Authors: | Bo Liu Jiawei Li Weiwei Lin Weihua Bai Pengfei Li Qian Gao |
| |
Affiliation: | 1. School of Computer Science, South China Normal University, Guangzhou, China;2. School of Computer Science and Engineering, South China University of Technology, Guangzhou, China;3. School of Computer Science, Zhaoqing University, Zhaoqing, China |
| |
Abstract: | In recent years, Docker container technology is being applied in the field of cloud computing at an explosive speed. The scheduling of Docker container resources has gradually become a research hotspot. Existing big data computing and storage platforms apply with traditional virtual machine technology, which often results in low resource utilization, a long time for flexible scaling and expanding clusters. In this paper, we propose an improved container scheduling algorithm for big data applications named Kubernetes-based particle swarm optimization(K-PSO). Experimental results show that the proposed K-PSO algorithm converges faster than the basic PSO algorithm, and the running time of the algorithm is cut in about half. The K-PSO container scheduling algorithm and algorithm experiment for big data applications are implemented in the Kubernetes container cloud system. Our experimental results show that the node resource utilization rate of the improved scheduling strategy based on K-PSO algorithm is about 20% higher than that of the Kube-scheduler default strategy, balanced QoS priority strategy, ESS strategy, and PSO strategy, while the average I/O performance and average computing performance of Hadoop cluster are not degraded. |
| |
Keywords: | |
|
|