arrow
Return

DRALBA: Dynamic and Resource Aware Load Balanced Scheduling Approach for Cloud Computing

delete2021-01-01
delete28
delete
OA
AI
S
Said Nabi
M
Muhammad Ibrahim *
J
Jose M. Jiménez
DOI:10.1109/ACCESS.2021.3074145delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
For the last few years, Cloud computing has been considered an attractive high-performance computing platform for individuals as well as organizations. The Cloud service providers (CSPs) are setting up data centers with high performance computing resources to accommodate the needs of Cloud users. The users are mainly interested in the response time, whereas the Cloud service providers are more concerned about the revenue generation. Concerning these requirements, the task scheduling for the users' applications in Cloud computing attained focus from the research community. Various task scheduling heuristics have been proposed that are available in the literature. However, the task scheduling problem is NP-hard in nature and thus finding optimal scheduling is always challenging. In this research, a resource-aware dynamic task scheduling approach is proposed and implemented. The simulation experiments have been performed on the Cloudsim simulation tool considering three renowned datasets, namely HCSP, GoCJ, and Synthetic workload. The obtained results of the proposed approach are then compared against RALBA, Dynamic MaxMin, DLBA, and PSSELB scheduling approaches concerning average resource utilization (ARUR), Makespan, Throughput, and average response time (ART). The DRALBA approach has revealed significant improvements in terms of attained ARUR, Throughput, and Makespan.This fact is endorsed by the average resource utilization results (i.e., 98 % for HCSP dataset, 75 % for Synthetic workload (improve ARUR by 72.00 %, 77.33 %, 78.67 %, and 13.33 % as compared to RALBA, Dynamic MaxMin, DLBA and PSSELB respectively), and 77 % for GoCJ (i.e., the second best attained ARUR)).
Keywords:
Task analysis
Dynamic scheduling
Cloud computing
Processor scheduling
Heuristic algorithms
Time factors
Optimal scheduling
Cloud computing
task scheduling
dynamic task scheduling
scheduling heuristics
tasks to VM mapping
load imbalance
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

U
Universitat Politecnica de Valencia
Scholars:
1.5W
Papers: 1.4W
Citations: 18
J
Jeju National University
Scholars:
4.5K
Papers: 4.5K
Citations: 4.6K