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.
Keyword :
Closest data center, Optimized response time, Dynamic Load, Round-Robin scheduling, Priority based scheduling