.png){kind=icon}
Return
Solving Task Scheduling Problem in Mobile Cloud Computing Using the Hybrid Multi-Objective Harris Hawks Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3329069.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nowadays, mobile devices can run a wide range of programs, and they all require more and more processing power. Due to their limited resources, mobile devices often make use of cloud computing $'\text{s}$ offloading features to do more complex tasks. The offloading problem in Mobile Cloud Computing (MCC) is the task scheduling problem, which entails deciding where to dump work to maximize its value. The task scheduling problem in MCC is an NP-hard problem because of the difficulty in moving resources and the size of the search space required to find the ideal scheduler, making the use of extensive search techniques impractical. For this reason, metaheuristic search strategies are provided, to yield a best-case or near-best-case scenario in terms of job completion time and energy savings. This work provides a non-dominated multi-objective strategy based on the Harris Hawks Optimization (HHO) technique called Hybrid Multi-objective Harris Hawks Optimization (HMHHO) to handle the described issue in MCC. The objectives of this research were allocating jobs from mobile source nodes to processors in the public cloud, cloud patches, and processors in mobile resources. In comparison to the other four algorithms-the Genetic Algorithm (GA), the Ant Colony Optimization (ACO), the Particle Swarm Optimization (PSO), and the Cuckoo Search Algorithm (CSA) the proposed method completes jobs faster and uses less energy on average.
Keywords:
Task analysis
Cloud computing
Optimization
Mobile handsets
Processor scheduling
Dynamic scheduling
Costs
Mobile computing
Metaheuristics
Task scheduling
multi-objective
mobile cloud computing
optimization
metaheuristic algorithm
Harris Hawks optimization
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations
Cited Papers
ShareSaveBehavior and biology of the tomato psyllid, Bactericerca cockerelli, in response to the Mi‐1.2 gene
PREAI
ShareSaveD-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveFunctional and structural brain differences associated with mirror-touch synaesthesiaNeuroImage
OAAI
NeuroImageIF0
OAAIShareSaveShareSaveShareSaveClustering based on whale optimization algorithm for IoT over wireless nodesSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSave View more