Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Journal: International Journal of Advanced Networking and Applications (Vol.8, No. 05)Publication Date: 2017-04-18
Authors : Navpreet Singh; Kanwalvir Singh Dhindsa;
Page : 3181-3187
Keywords : Closest data center; Optimized response time; Dynamic Load; Round-Robin scheduling; Priority based scheduling;
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.
Other Latest Articles
- Web-Based User Interface for the Floodlight SDN Controller
- Learning Experiences and Performance Evaluation of Engineering Students' In Mathematics Using Hybrid Blended Learning System (HBLS) Via Social Media Networks
- Clinical management of foot rot in goats: A case report of lameness
- Clinical management of maggot wounds in Bengal Tigers (Panthera tigris tigris)
- Comparison of pathogenicity of relapsed, field and mixed isolates of Trypanosoma brucei brucei infections in rats
Last modified: 2017-05-01 17:09:42