A Taxonomy and Survey of Scheduling Algorithms in Cloud: Based on task dependency

Abstract

Cloud computing has made the dream of scalability of resources on demand come true. As the usage of the resources on the cloud involves cost, their optimal utilization is vital. Various scheduling algorithms are being designed and implemented seamlessly to achieve this goal. One of the factors that have a high impact on the scheduling algorithm design is the dependency of the tasks. Dependency implies that the tasks are executed in some precedence order. This survey provides a review of the various scheduling algorithms in cloud mainly from the perspective of task dependency. The broad categorization, advantages and the disadvantages of the various scheduling algorithms available for both dependent and independent tasks are discussed. Based on a comprehensive understanding of the challenges and the current research trends, some open issues worthy of further exploration are proposed.

A Hybrid Approach Based on Grey Wolf and Whale Optimization Algorithms for Solving Cloud Task Scheduling Problem

“…Mathematical Problems in Engineering Service (SaaS), Platform as Service (PaaS), and Infrastructure as Service (IaaS), respectively [33]. Task scheduling can be understood as the planning of tasks according to a particular pool of resources that may be allocated between several administrative domains [32].…”

“…e design and implementation of scheduling algorithms must take into account several factors, including cost, delay, priority, deadline, security, and energy efficiency, as well as the goals of scheduling. From the perspective of cloud services, the latter can be classified in relation to service providers and service users, as seen in Figure 1 [33]. As multitasking and multiplexing have become essential requirement of the latest applications (e.g., IoT and AI), scheduling algorithms are becoming increasingly in demand [34].…”

Heuristic based Independent Task Scheduling Techniques in Cloud Computing: A Review

“…A task which do not require any communication (dependency) with other tasks is called independent task, where as dependent tasks are different as they have some precedence order to be followed [9] during the scheduling process. Let there are 7 tasks: T0 to T7, if they are independent then scheduler can map those independently means without keeping any order.…”

Energy Efficient Scheduling Methods for Computational Grids and Clouds

“…An example problem that is the subject of many studies in modern task scheduling methods is Independent Batch Scheduling (IBS) [12], [18], [19]. In this problem the tasks are gathered into batches and independently processed on assigned resources.…”