scholarly journals Task Scheduling Algorithms for Cloud Computing: A Critical Review and Open Research Challenges

2021 ◽  
Author(s):  
Gagandeep Kaur ◽  
Anurag Sharma
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Critical Review ◽  
Scheduling Algorithms ◽  
Optimal Scheduling ◽  
Metaheuristic Algorithms ◽  
On Demand ◽  
Research Challenges ◽  
Open Research ◽  
Better Than

Cloud computing is the most preferred platform to access resources remotely. The benefit of cloud computing over traditional computing techniques is that it provides on-demand services and serves millions of users at the same time. However, scheduling the tasks of users is quite crucial in cloud computing. To overcome this challenge, various task scheduling algorithms have been designed for cloud computing. In this paper, we have done a critical review of various traditional and metaheuristic algorithms based on task scheduling algorithms. The critical review shows that the metaheuristic algorithms are better than traditional algorithms to find the optimal scheduling of the task. Besides that, based on the study, we have defined the open research challenges of the metaheuristic algorithms that help other authors to contribute their research in this field.

scholarly journals REVIEW OF TASK SCHEDULING METHODS FOR REAL TIME TASKS IN CLOUD ENVIRONMENT

2020 ◽  
Vol 5 (1) ◽  
pp. 85-89
Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya
Keyword(s):  
Cloud Computing ◽  
Real Time ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Dynamic Scheduling ◽  
Scheduling Algorithms ◽  
Minimum Time ◽  
Cloud Environment ◽  
Static Scheduling ◽  
On Demand

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.

scholarly journals HAMM: A Hybrid Algorithm of Min-Min and Max-Min Task Scheduling Algorithms in Cloud Computing

2020 ◽  
Vol 9 (4) ◽  
pp. 209-218
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Hybrid Algorithm ◽  
Heuristic Algorithms ◽  
Scheduling Algorithms ◽  
Cloud Computing Environment ◽  
Concurrent Execution ◽  
Optimization Parameters ◽  
Better Than

Nowadays, with the huge development of information and computing technologies, the cloud computing is becoming the highly scalable and widely computing technology used in the world that bases on pay-per-use, remotely access, Internet-based and on-demand concepts in which providing customers with a shared of configurable resources. But, with the highly incoming user’s requests, the task scheduling and resource allocation are becoming major requirements for efficient and effective load balancing of a workload among cloud resources to enhance the overall cloud system performance. For these reasons, various types of task scheduling algorithms are introduced such as traditional, heuristic, and meta-heuristic. A heuristic task scheduling algorithms like MET, MCT, Min-Min, and Max-Min are playing an important role for solving the task scheduling problem. This paper proposes a new hybrid algorithm in cloud computing environment that based on two heuristic algorithms; Min-Min and Max-Min algorithms. To evaluate this algorithm, the Cloudsim simulator has been used with different optimization parameters; makespan, average of resource utilization, load balancing, average of waiting time and concurrent execution between small length tasks and long size tasks. The results show that the proposed algorithm is better than the two algorithms Min-Min and Max-Min for those parameters

scholarly journals Job Scheduling in Cloud Computing Using a Modified Harris Hawks Optimization and Simulated Annealing Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-17 ◽  
Author(s):  
Ibrahim Attiya ◽  
Mohamed Abd Elaziz ◽  
Shengwu Xiong
Keyword(s):  
Cloud Computing ◽  
Simulated Annealing ◽  
Large Scale ◽  
Simulated Annealing Algorithm ◽  
Job Scheduling ◽  
Search Algorithm ◽  
Scheduling Algorithms ◽  
Scheduling Problems ◽  
It Services ◽  
On Demand

In recent years, cloud computing technology has attracted extensive attention from both academia and industry. The popularity of cloud computing was originated from its ability to deliver global IT services such as core infrastructure, platforms, and applications to cloud customers over the web. Furthermore, it promises on-demand services with new forms of the pricing package. However, cloud job scheduling is still NP-complete and became more complicated due to some factors such as resource dynamicity and on-demand consumer application requirements. To fill this gap, this paper presents a modified Harris hawks optimization (HHO) algorithm based on the simulated annealing (SA) for scheduling jobs in the cloud environment. In the proposed HHOSA approach, SA is employed as a local search algorithm to improve the rate of convergence and quality of solution generated by the standard HHO algorithm. The performance of the HHOSA method is compared with that of state-of-the-art job scheduling algorithms, by having them all implemented on the CloudSim toolkit. Both standard and synthetic workloads are employed to analyze the performance of the proposed HHOSA algorithm. The obtained results demonstrate that HHOSA can achieve significant reductions in makespan of the job scheduling problem as compared to the standard HHO and other existing scheduling algorithms. Moreover, it converges faster when the search space becomes larger which makes it appropriate for large-scale scheduling problems.

Efficient on Demand Dynamic Availability-Distribution-Span Scheduling and Load Balancing Scheme for Cloud Computing

2016 ◽  
Vol 13 (10) ◽  
pp. 7655-7660 ◽  
Author(s):  
V Jeyakrishnan ◽  
P Sengottuvelan
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Resource Utilization ◽  
Scheduling Algorithms ◽  
Time Factor ◽  
Cloud Environment ◽  
On Demand ◽  
Availability Factor ◽  
Scheduling Method

The problem of load balancing in cloud environment has been approached by different scheduling algorithms. Still the performance of cloud environment has not been met to the point and to overcome these issues, we propose a naval ADS (Availability-Distribution-Span) Scheduling method to perform load balancing as well as scheduling the resources of cloud environment. The method performs scheduling and load balancing in on demand nature and takes dynamic actions to fulfill the request of users. At the time of request, the method identifies set of resources required by the process and computes Availability Factor, Distributional Factor and Span Time factor for each of the resource available. Based on all these factors computed, the method schedules the requests to be processed in least span time. The proposed method produces efficient result on scheduling as well as load balancing to improve the performance of resource utilization in the cloud environment.

Sign in / Sign up

Export Citation Format

Share Document