Task Scheduling by Hybrid Metaheuristic Approach in Cloud Environment

Abstract

Abstract: Recent advancements in hardware, virtualization technology, distributed computing, and service delivery over the Internet have led to the formation of cloud computing. In a distributed computing platform, the scheduling of task workflow is a well-known NP-hard problem. This becomes more complex and challenging if the virtualized clusters execute a large number of tasks in a cloud computing platform. From low-level execution tasks in multiple processors to high-level execution tasks, many heuristics have been proposed. This chapter deals with the proposed min-min algorithm, max-min algorithm, PSO, and TS. The max-min and min-min algorithms estimate the execution time and overall completion time of all the tasks Then assign the tasks on better suitable resource. PSO is simple and effective in a wide range of applications with low computational cost and fast speed. TS approach is one of the popular local search techniques based on neighborhood search algorithm. TS can be directly applied to any kind of virtual optimization problem.