Dependent task offloading with deadline-aware scheduling in mobile edge networks
In the field of the Internet of Things (IoT), Edge computing has emerged as a revolutionary paradigm that offers unprecedented benefits by serving the IoT at the network edge. One of the primary advantages of edge computing is that it reduces the job completion time by offloading tasks at the edge s...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Published: |
Elsevier B.V.
2023
|
Online Access: | http://scholars.utp.edu.my/id/eprint/37335/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-85165086130&doi=10.1016%2fj.iot.2023.100868&partnerID=40&md5=8165e27589c2708495ed2591ecc90a41 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
oai:scholars.utp.edu.my:37335 |
---|---|
record_format |
eprints |
spelling |
oai:scholars.utp.edu.my:373352023-10-04T08:41:49Z http://scholars.utp.edu.my/id/eprint/37335/ Dependent task offloading with deadline-aware scheduling in mobile edge networks Maray, M. Mustafa, E. Shuja, J. Bilal, M. In the field of the Internet of Things (IoT), Edge computing has emerged as a revolutionary paradigm that offers unprecedented benefits by serving the IoT at the network edge. One of the primary advantages of edge computing is that it reduces the job completion time by offloading tasks at the edge server from the IoT. Typically, a job is made up of dependent tasks in which the output of one task is required as the input to the other. This work proposes a directed cyclic graph model that represents the dependencies among these tasks focusing on jointly optimizing task dependencies with deadline constraints for tasks that are delay-sensitive. Thus, dependent tasks are scheduled while considering their deadlines using priority-aware scheduling. For tasks with no deadlines, the processing is done with First-Come-First-Serve (FCFS) scheduling. The tasks with a priority are offloaded to the suitable edge server for processing by using a priority queue to enhance the task satisfaction rate under deadline constraints. To model the suitable edge server decision, we use the Markov decision process (MDP) that minimizes the total completion time. Additionally, we model the mobility of users while offloading tasks to the edge servers. The throughput results demonstrate that the proposed strategy outperforms random offloading, the highest data rate offloading (HDR), the highest computing device (HCD), and delay-dependent priority-aware offloading (DPTO), by 66.67, 43.75, 27.78, and 4.55, respectively. Furthermore, the proposed strategy surpasses random, HDR, and HCD offloading in terms of task satisfaction rate by 20.48, 16.28, and 12.36, respectively. © 2023 Elsevier B.V. Elsevier B.V. 2023 Article NonPeerReviewed Maray, M. and Mustafa, E. and Shuja, J. and Bilal, M. (2023) Dependent task offloading with deadline-aware scheduling in mobile edge networks. Internet of Things (Netherlands), 23. ISSN 25426605 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85165086130&doi=10.1016%2fj.iot.2023.100868&partnerID=40&md5=8165e27589c2708495ed2591ecc90a41 10.1016/j.iot.2023.100868 10.1016/j.iot.2023.100868 10.1016/j.iot.2023.100868 |
institution |
Universiti Teknologi Petronas |
building |
UTP Resource Centre |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Petronas |
content_source |
UTP Institutional Repository |
url_provider |
http://eprints.utp.edu.my/ |
description |
In the field of the Internet of Things (IoT), Edge computing has emerged as a revolutionary paradigm that offers unprecedented benefits by serving the IoT at the network edge. One of the primary advantages of edge computing is that it reduces the job completion time by offloading tasks at the edge server from the IoT. Typically, a job is made up of dependent tasks in which the output of one task is required as the input to the other. This work proposes a directed cyclic graph model that represents the dependencies among these tasks focusing on jointly optimizing task dependencies with deadline constraints for tasks that are delay-sensitive. Thus, dependent tasks are scheduled while considering their deadlines using priority-aware scheduling. For tasks with no deadlines, the processing is done with First-Come-First-Serve (FCFS) scheduling. The tasks with a priority are offloaded to the suitable edge server for processing by using a priority queue to enhance the task satisfaction rate under deadline constraints. To model the suitable edge server decision, we use the Markov decision process (MDP) that minimizes the total completion time. Additionally, we model the mobility of users while offloading tasks to the edge servers. The throughput results demonstrate that the proposed strategy outperforms random offloading, the highest data rate offloading (HDR), the highest computing device (HCD), and delay-dependent priority-aware offloading (DPTO), by 66.67, 43.75, 27.78, and 4.55, respectively. Furthermore, the proposed strategy surpasses random, HDR, and HCD offloading in terms of task satisfaction rate by 20.48, 16.28, and 12.36, respectively. © 2023 Elsevier B.V. |
format |
Article |
author |
Maray, M. Mustafa, E. Shuja, J. Bilal, M. |
spellingShingle |
Maray, M. Mustafa, E. Shuja, J. Bilal, M. Dependent task offloading with deadline-aware scheduling in mobile edge networks |
author_facet |
Maray, M. Mustafa, E. Shuja, J. Bilal, M. |
author_sort |
Maray, M. |
title |
Dependent task offloading with deadline-aware scheduling in mobile edge networks |
title_short |
Dependent task offloading with deadline-aware scheduling in mobile edge networks |
title_full |
Dependent task offloading with deadline-aware scheduling in mobile edge networks |
title_fullStr |
Dependent task offloading with deadline-aware scheduling in mobile edge networks |
title_full_unstemmed |
Dependent task offloading with deadline-aware scheduling in mobile edge networks |
title_sort |
dependent task offloading with deadline-aware scheduling in mobile edge networks |
publisher |
Elsevier B.V. |
publishDate |
2023 |
url |
http://scholars.utp.edu.my/id/eprint/37335/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-85165086130&doi=10.1016%2fj.iot.2023.100868&partnerID=40&md5=8165e27589c2708495ed2591ecc90a41 |
_version_ |
1779441367269769216 |
score |
13.18916 |