A Study on Task Scheduling Algorithms in Cloud Computing
Vijayalakshmi A. Lepakshi · 2013
Cloud computing is a new computing model using which applications, data and IT services are provided over the Internet. Cloud computing shares data and offers services transparently among its users. With the increase in number of users of cloud the tasks to be scheduled increases. The performance of cloud depends on the task scheduling algorithms used in the scheduling components or brokering components. Scheduling parallel applications modeled by Directed Acyclic Graphs onto a network of heterogeneous computers is a NP-Complete problem. A number of algorithms have been proposed in the past to solve the task-scheduling problem for heterogeneous network of computers. However, none of these algorithms can be extended to cloud computing systems which are also heterogeneous computing systems. Since cloud computing systems have a high degree of unpredictability with respect to resource availability and network bandwidth, task scheduling algorithms for cloud computing systems should incorporate the latency caused by unpredictable resource availability. The present study involves surveying the different task scheduling algorithms developed for cloud environment.