Research of improved shuffled frog leaping algorithm in cloud computing resources

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Resource scheduling under the condition of cloud computing has always been the focus of current research. This paper analyzes the current situation of cloud computing and introduces shuffled frog leaping algorithm in resource allocation. Aiming at that shuffled frog algorithm is easy to fall into local optimum with fast convergence speed, artificial vector machine is introduced into the subgroups of shuffled frog leaping algorithm, then, self-adaptive crossover probability is introduced into the algorithm’s interior searching. The improved shuffled frog leaping algorithm effectively avoids the algorithm from falling into local optimum and meanwhile shortens the time of global searching and optimum. Classic function proves the performance of algorithm in this paper is improved greatly, and CloudSim platform demonstrates that algorithm in this paper can improve the system’s efficiency into processing tasks and make resource allocation in cloud computing reasonable and effective.

Cite

CITATION STYLE

APA

Chen, X., & Huang, W. (2016). Research of improved shuffled frog leaping algorithm in cloud computing resources. International Journal of Grid and Distributed Computing, 9(3), 71–82. https://doi.org/10.14257/ijgdc.2016.9.3.09

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