The Cloud Computing Tasks Scheduling Algorithm Based on Improved K-Means

Article Preview

Abstract:

Cloud task scheduling is a hot technology today, how to effectively improve the utilization of resources, time efficiency, load balancing, is the focus and difficult of the study. The time efficiency, load balancing of K-Min algorithm still need to be improved, so this paper proposes cloud computing task scheduling algorithm based on modified K-Means (Improved K-Min), firstly, This paper improves the k-means algorithm using the BFA and PSO,then according to the length attribute of the task, resource requirements, the algorithm uses the improved K-means for packet processing tasks, then performs Min-Min scheduling algorithm within the group. Through theoretical research and simulation of Cloud-sim platform, when the number of tasks is 300, experimental result is best, comparing with Min-Min algorithm, the total task completion time improved 17.13%.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1830-1834

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhao Fei, Wu Hang, Gong Yue. Research on Solving the Problem of Task Scheduling in Grid Environment by Ant Colony Algorithm[J]. CHANGCHUN University of Technology (Natural Science Edition), 2013, 36 (1-2): 98 - 100.

Google Scholar

[2] Yuan Ke, Zhou An-Jun, Wang Xiao-Hui. For grid computing Min-Min algorithm and implementation[J]. SCIENCE & TECHNOLOGY INFORMATION, 2013 (23): 87-88.

Google Scholar

[3] Tracy D. BRAUN, Howard Jay Siegel, Noah Beck. A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems[J]. Journal of Parallel and Distributed Computing, 2001, 61: 810-837.

DOI: 10.1006/jpdc.2000.1714

Google Scholar

[4] Cao Lei. The Strategy of Grid Resource Scheduling Based on Qos[J]. HUAIBEI Coal Industry Teachers College (Natural Science Edition), 2009, 30 (4): 57-59.

Google Scholar

[5] Yang Li, Wu Xiao-Nian. A Task Scheduling Algorithm Based on K-Means for Cloud Computing [J]. Popular Science, 2012, 14 (153): 37-39.

Google Scholar

[6] Zuo Li-Yun, Zuo Li-Feng. Cloud computing scheduling optimization algorithm based on reservation category[J]. Computer Engineering and Design, 2012, 33 (4): 1357-1361.

Google Scholar

[7] Mac Queen J. Some Methods for Classification and Analysis of Multivariate Observations[C]. proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. Berkeley: University of California Press, 1967: 281-297.

Google Scholar

[8] Rezaee M R, Lelieveldt B P, Reiber J H. A New Cluster Validity Index for the Fuzzy C-Means[J]. Pattern Recognition Letters, 1998, 19(3-4): 237-246.

DOI: 10.1016/s0167-8655(97)00168-2

Google Scholar

[9] Xu Hui, Li Shi-Jun. A Clustering algorithm integration particles swarm optimization and K-Means algorithm[J]. SHANXI University newspaper, 2011, 34 (4): 518-523.

Google Scholar

[10] Liu Li-Li, Gao Xing-BAO. An adaptive bacterial foraging algorithm simulation [J]. Basic Sciences Journal of Textile Universities, 2012, 25 (4): 502-506.

Google Scholar

[11] Li Jun, Dang Jian-Wu. Research and Improvement of Bacteria Foraging Optimization Algorithm [J]. Computer Simulation, 2013, 30 (4): 344-346.

Google Scholar

[12] Huang Tai-an, Sheng Jia-Gen, XU Hong-Yang, etc. Improved Simplified Particle Swarm Optimization [J]. Computer Simulation, 2013, 30 (2): 327-330.

Google Scholar