Task Scheduling Based on Hybrid Algorithm for Cloud Computing

Abstract

Transmission of data via internet is one of the great purposes of cloud computing is popular for transferring and storing data via internet. The user can make use of cloud services through broker. But since the job initialization is dynamic the concepts like scheduling of jobs and task management is of crucial importance. The main reason is that the users can request the use of same resources at a time. Thus, managing the resources over the requests is important so that all users can access the resources. Although generic scheduling techniques like FCFS or priority scheduling are available in many ways they fall short in they’re purposeless, due to their own disadvantages. The algorithms have higher waiting time and high turnaround time, which is not that efficient when the number of jobs in cloud environments is very large. Here a hybrid of shortest job first and priority based Scheduling is used and implemented in a cloud environment and analyzed. The conclusions are noted down and they are promising enough. The average waiting time and turnaround time are greatly reduced and highly increased the efficiency of cloud management of resources. Cloud computing includes an online exchange of data, resources, and information, where the users are in constant need of resources. This causes congestion of network, starvation or at worst case a deadlock. To counter these problems occurring a new methodology of hybrid algorithm has been proposed by implementing two techniques namely, shortest job first and priority-based scheduling.