Loading…

Improved Butterfly Optimization Algorithm for Data Placement and Scheduling in Edge Computing Environments

Mobile edge computing (MEC) is an interesting technology aimed at providing various processing and storage resources at the edge of mobile devices (MDs). However, MECs contain limited resources, and they should be appropriately managed to prevent resource wastage. Workflow scheduling is a process th...

Full description

Saved in:
Bibliographic Details
Published in:Journal of grid computing 2021-06, Vol.19 (2), Article 14
Main Authors: Hosseinzadeh, Mehdi, Masdari, Mohammad, Rahmani, Amir Masoud, Mohammadi, Mokhtar, Aldalwie, Adil Hussain Mohammed, Majeed, Mohammed Kamal, Karim, Sarkhel H. Taher
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Mobile edge computing (MEC) is an interesting technology aimed at providing various processing and storage resources at the edge of mobile devices (MDs). However, MECs contain limited resources, and they should be appropriately managed to prevent resource wastage. Workflow scheduling is a process that tries to map tasks to the most proper set of resources based on some objectives. This paper presents DBOA, a discrete version of the Butterfly Optimization Algorithm (BOA) that applies the Levy flight method to improve its convergence speed and prevent local optima problems. We also employed a task prioritization method to find the task execution order in the scientific workflows. Then, we use DBOA for Dynamic Voltage and Frequency Scaling or DVFS-based data-intensive workflow scheduling and data placement in MEC environments. For evaluating the performance of the proposed scheduling scheme, extensive simulations are conducted on various well-known scientific workflows with different sizes. The obtained experimental results indicate that our method can outperform other algorithms in terms of energy consumption, data access overheads, and so on.
ISSN:1570-7873
1572-9184
DOI:10.1007/s10723-021-09556-0