Efficient Task Scheduling With Stochastic Delay Cost in Mobile Edge Computing

Wenyu Zhang; Zhenjiang Zhang; Sherali Zeadally; Han Chieh Chao

doi:10.1109/LCOMM.2018.2879317

Efficient Task Scheduling With Stochastic Delay Cost in Mobile Edge Computing

Wenyu Zhang, Zhenjiang Zhang, Sherali Zeadally, Han Chieh Chao

School of Information Science

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Abstract

We propose a new efficient and effective task scheduling approach with stochastic time cost for computation offloading in mobile edge computing. We developed an optimization model that minimizes the maximum tolerable delay (MTD) by considering both the average delay and delay jitter. We also proposed an efficient conservative heterogeneous earliest-finish-time algorithm to solve the MTD-minimization problem. Numerical results obtained with our proposed approach demonstrate its effectiveness over previously proposed techniques.

Original language	English
Article number	8523681
Pages (from-to)	4-7
Number of pages	4
Journal	IEEE Communications Letters
Volume	23
Issue number	1
DOIs	https://doi.org/10.1109/LCOMM.2018.2879317
State	Published - Jan 2019

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Funding

Manuscript received October 11, 2018; revised October 25, 2018; accepted October 29, 2018. Date of publication November 5, 2018; date of current version January 8, 2019. This work is supported by National Natural Science Foundation of China under grant 61772064, and Academic Discipline, Post-Graduate Education Project of the Beijing Municipal Commission of Education, and Fundamental Research Funds for the Central Universities under grant 2017YJS026. The associate editor coordinating the review of this paper and approving it for publication was J. Ben Othman. (Corresponding author: Zhenjiang Zhang.) W. Zhang and Z. Zhang are with the Key Laboratory of Communication and Information Systems, Beijing Municipal Commission of Education, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China (e-mail: [email protected]).

Funders	Funder number
National Natural Science Foundation of China (NSFC)	61772064
Beijing Municipal Commission of Education
Fundamental Research Funds for the Central Universities	2017YJS026

Keywords

Call graph
delay jitter
mobile edge computing
scheduling
stochastic delay

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2018.2879317

Cite this

@article{ccc7130f3ae04d5f966eebee8254502a,

title = "Efficient Task Scheduling With Stochastic Delay Cost in Mobile Edge Computing",

abstract = "We propose a new efficient and effective task scheduling approach with stochastic time cost for computation offloading in mobile edge computing. We developed an optimization model that minimizes the maximum tolerable delay (MTD) by considering both the average delay and delay jitter. We also proposed an efficient conservative heterogeneous earliest-finish-time algorithm to solve the MTD-minimization problem. Numerical results obtained with our proposed approach demonstrate its effectiveness over previously proposed techniques.",

keywords = "Call graph, delay jitter, mobile edge computing, scheduling, stochastic delay",

author = "Wenyu Zhang and Zhenjiang Zhang and Sherali Zeadally and Chao, {Han Chieh}",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.",

year = "2019",

month = jan,

doi = "10.1109/LCOMM.2018.2879317",

language = "English",

volume = "23",

pages = "4--7",

number = "1",

}

TY - JOUR

T1 - Efficient Task Scheduling With Stochastic Delay Cost in Mobile Edge Computing

AU - Zhang, Wenyu

AU - Zhang, Zhenjiang

AU - Zeadally, Sherali

AU - Chao, Han Chieh

PY - 2019/1

Y1 - 2019/1

N2 - We propose a new efficient and effective task scheduling approach with stochastic time cost for computation offloading in mobile edge computing. We developed an optimization model that minimizes the maximum tolerable delay (MTD) by considering both the average delay and delay jitter. We also proposed an efficient conservative heterogeneous earliest-finish-time algorithm to solve the MTD-minimization problem. Numerical results obtained with our proposed approach demonstrate its effectiveness over previously proposed techniques.

AB - We propose a new efficient and effective task scheduling approach with stochastic time cost for computation offloading in mobile edge computing. We developed an optimization model that minimizes the maximum tolerable delay (MTD) by considering both the average delay and delay jitter. We also proposed an efficient conservative heterogeneous earliest-finish-time algorithm to solve the MTD-minimization problem. Numerical results obtained with our proposed approach demonstrate its effectiveness over previously proposed techniques.

KW - Call graph

KW - delay jitter

KW - mobile edge computing

KW - scheduling

KW - stochastic delay

UR - http://www.scopus.com/inward/record.url?scp=85056192034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056192034&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2018.2879317

DO - 10.1109/LCOMM.2018.2879317

M3 - Article

AN - SCOPUS:85056192034

SN - 1089-7798

VL - 23

SP - 4

EP - 7

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 1

M1 - 8523681

ER -

Efficient Task Scheduling With Stochastic Delay Cost in Mobile Edge Computing

Abstract

Bibliographical note

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this