International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing


Affiliations
1 CSE & IT Deptt., BBSB Engineering College, Fatehgarh Sahib, Punjab, India
2 CSE & IT Deptt., BBSB Engineering College, Fatehgarh Sahib, Punja, India
 

In cloud computing environment, various users send requests for the transmission of data for different demands. The access to different number of users increase load on the cloud servers. Due to this, the cloud server does not provide best efficiency. To provide best efficiency, load has to be balanced. The highlight of this work is the division of different jobs into tasks. The job dependency checking is done on the basis of directed acyclic graph. The dependency checking the make span has to be created on the basis of first come first serve and priority based scheduling algorithms. In this paper, each scheduling algorithm has been implemented sequentially and the hybrid algorithm (round robin and priority based) has also been compared with other scheduling algorithms.


Keywords

Closest Data Center, Optimized Response Time, Dynamic Load, Round-Robin Scheduling, Priority Based Scheduling.
User
Notifications
Font Size

  • K. Kishor, V. Thapar, “An efficient service broker policy for Cloud computing environment”, International Journal of Computer Science Trends and Technology (IJCST) - Vol. 2, Issue 4, July-Aug 2014.

  • Qiang Li, Qinfen Hao, Limin Xiao, “Adaptive management of virtualized resources in cloud

  • T.C. Chieu, A. Mohindra, A.A. Karve, A. Segal, “Dynamic Scaling of Web Applications in a Virtualized Cloud Computing Environment,” in IEEE International Conference on e-Business Engineering, pp. 281-286, Dec. 2009.

  • L. Jiyin, Q. Meikang, J.W. Niu, Y. Chen, and Ming, Adaptive Resource Allocation for Preeemptable Jobs in Cloud Systems, IEEE International Conference on Intelligent Systems Design and Applications, pp. 31-36, 2010.

  • B. Wickremasinghe, N. Rodrigo Calheiros, and R. Buyya, Cloud Analyst: A CloudSim-based Visual Modeller for Analyzing Cloud Computing Environments and Applications, IEEE, January 2011.

  • Milan E. Soklic “Simulation of Load balancing algorithms” ACM-SIGCSE Bulletin, Vol.34, Issue 4, December 2002.

  • Jaspreet Kaur, “Comparison of Load balancing algorithms in a Cloud”, International Journal of Engineering Research and Applications”, Vol. 2, Issue 3, May-June 2012.

  • Zhang Bo, Gao Ji, Ai Jieqing, “Cloud Loading Balance algorithm”, Information Science and Engineering, Second International Conference, Vol.2, No.5, 4-6 Dec. 2010.

  • Z. Xiao, W. Song, and Q. Chen, “Dynamic resource allocation using virtual machines for cloud computing environment,” IEEE Transactions on Parallel and Distributed Systems, Vol. 24, No. 6, pp. 1107-1117, 2013.

  • Di Caro, G. Dorigo, M. Mobile, “Agents for adaptive routing” in Proceedings of the Thirty-First Hawaii International Conference on System Sciences, Kohala Coast, HI, USA, Vol.7, pp. 74–83, January 1998.

  • Bo, Z., Ji, G., Jieqing, A., “Cloud Loading Balance algorithm”, Proceedings of the 2010 2nd International Conference on Information Science and Engineering, Hangzhou, China, pp. 5001–5004, December 2010.

  • Wu Lee, Chan, Huang, “Dynamic load balancing mechanism based on cloud storage”, Computing, Communications and Applications Conference, Hong Kong, China, pp. 102–106, January 2012.

  • A. Bhadani, Chaudhary, “Performance evaluation of web servers using central load balancing policy over virtual machines on cloud”, Third Annual ACM Bangalore Conference, Bangalore, India, pp. 16-19, January 2010.

  • K. Nishant, P. Sharma, V.Krishna, C. Gupta, K.P. Singh, N. Nitin, R. Rastogi, “Lord Balancing of Nodes in Cloud Using Ant Colony Optimization”, 2012 UK Sim 14th International Conference on Computer Modelling and Simulation, Cambridge, UK, pp.3-8, March 2012.

  • A.P. Deshmukh, Prof. K.Pamu, “Applying Load Balancing: A Dynamic Approach”, (IJARCSSE), Vol.2, Issue 6, June 2012.


Abstract Views: 164

PDF Views: 2




  • Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing

Abstract Views: 164  |  PDF Views: 2

Authors

Navpreet Singh
CSE & IT Deptt., BBSB Engineering College, Fatehgarh Sahib, Punjab, India
Kanwalvir Singh Dhindsa
CSE & IT Deptt., BBSB Engineering College, Fatehgarh Sahib, Punja, India

Abstract


In cloud computing environment, various users send requests for the transmission of data for different demands. The access to different number of users increase load on the cloud servers. Due to this, the cloud server does not provide best efficiency. To provide best efficiency, load has to be balanced. The highlight of this work is the division of different jobs into tasks. The job dependency checking is done on the basis of directed acyclic graph. The dependency checking the make span has to be created on the basis of first come first serve and priority based scheduling algorithms. In this paper, each scheduling algorithm has been implemented sequentially and the hybrid algorithm (round robin and priority based) has also been compared with other scheduling algorithms.


Keywords


Closest Data Center, Optimized Response Time, Dynamic Load, Round-Robin Scheduling, Priority Based Scheduling.

References