Quality of service-based particle swarm optimization scheduling in cloud computing

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Scheduling is important in cloud computing system. In this paper, an adaptive particle swarm optimization (PSO) algorithm is proposed to optimize quality of service (Qos)-guided task scheduling in cloud computing. This scheduling targets a trade-off between completion time and cost. The proposed algorithm adaptively changes PSO parameters according to the evolution state evaluation. This adaptation can avoid premature convergence and explore the search space more efficiently. When swarms are trapped into premature convergence, mutation is introduced to the velocity and position updating strategy to improve the ability of global search. Simulation results reveal that the algorithm can achieve significant optimization of completion time and cost.

Cite

CITATION STYLE

APA

Zhao, S., Lu, X., & Li, X. (2015). Quality of service-based particle swarm optimization scheduling in cloud computing. In Lecture Notes in Electrical Engineering (Vol. 355, pp. 235–242). Springer Verlag. https://doi.org/10.1007/978-3-319-11104-9_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free