Task Scheduling Using an Adaptive PSO Algorithm in Cloud Computing Environment

Authors

  • B. Sivaramakrishna  Research Scholar, Department of Computer Science and Engineering, Acharya Nagarjuna University, Guntur, Andhra Pradesh, India
  • Dr. T. V. Rao  Professor, Department of Computer Science and Engineering, PVPSIT, Krishna, Andhra Pradesh, India

DOI:

https://doi.org//10.32628/IJSRSET196279

Keywords:

Cloud environment, ACO, PSO, Task Scheduling.

Abstract

Now-a-days energy planners are aiming to increase the use of renewable energy sources and nuclear to meet the electricity generation. But till now coal-based power plants are the major source of electricity generation. The problem of task scheduling is one of the most important steps in taking advantage of the cloud computing environment. Various experiments show that although it is almost impossible to have an optimal solution, it seems that there is a more optimal solution using heuristic algorithms. This work compares three heuristic approaches to scheduling cloud environment tasks. These approaches are the PSO algorithm, the ACO, and the adaptive PSO algorithm for efficient task scheduling. The goal of all three of these algorithms is to generate an optimal schedule to minimize task completion time.

References

  1. Chinese cloud computing. Peng Liu: the definition and characteristics of cloud computing, http: //www.chinacloud.cn/.2009-2-25.
  2. R. Buyya, CS Yeo, S. Venugopal, J. Broberg, I. Brandic, “Cloud Computing and Emerging IT Platforms”, Vision, Leap and Reality in Computing as 5th Utility, Next Generation Computer Systems 25 (6), 599–616 (2009). http://dx.doi.org/10.1016/j.future.2008.12.001
  3. P. Kumar, A. Verma, “Independent Timing of Tasks in Cloud Computing Using an Advanced Genetic Algorithm”, International Journal of International Computer Science and Software Engineering Research, Vol2, 5th Edition, May 2012.
  4. Z. Yingfeng, L. Yulin, “Network Computing Resource Management Schedule Based on the Evolution Algorithm j]”, Computer Engineering Conference, 2003, 29 (15): 1102175.
  5. P. Roy, M. Mejbah, N. Das. “Timing of Heuristic-Based Tasks with a Genetic Algorithm for Multiprocessor Systems by Selecting a Suitable Processor,” International Journal of Distributed and Parallel Systems (IJDPS), Vol3, No. 4, July 2012.
  6. Abraham, R. Buyya and B. Nath. “Natural Heuristics in Computer Network Workplace Design”, IEEE Eighth International Advanced Computing and Communication Conference (ADCOM 2000), India, 2000.
  7. H. Yin, H. Wu, J. Zhou, “Advanced Genetic Algorithm Constrained Rat Ion Grid Design,” IEEE Sixth International Network and Collaborative Processing Conference, GCC 2007, Los Alamitos, CA, p. 221-227, 2007.
  8. R. Verma, S. Dhingra, “Genetic Algorithm for Scheduling Multiprocessor Tasks”, IJCSMS International Journal of Computer Science and Management Studies, Volume 1, Edition 02, pp. 181-185, 2011
  9. J. Kennedy, RC Eberhart, “Optimization of Particle Swarms,” Proc, IEEE Conf. Neural network, vol. IV, IEEE, Piscataway, NJ, 1995, pp. 1942-1948.
  10. L. Zhang, Y. Chen, B. Yang, “PSO Algorithm-Based Task Schedule in a Computer Network,” Proceedings of the 6th International Conference on Intelligent Systems Design and Applications, Part 2, pp. 16-18. October 2006, Jinan, China.
  11. T. Chen, B. Zhang, X. Hao, Y. Dai, “Scheduling Tasks in a Network Based on Particle Swarm Optimization,” Fifth International Symposium on Parallel and Distributed Computing, ISPDC '06. pp. 238-245, 2006.

Downloads

Published

2018-09-30

Issue

Section

Research Articles

How to Cite

[1]
B. Sivaramakrishna, Dr. T. V. Rao, " Task Scheduling Using an Adaptive PSO Algorithm in Cloud Computing Environment, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 10, pp.419-426, September-October-2018. Available at doi : https://doi.org/10.32628/IJSRSET196279