A Hybrid Task Scheduling Scheme for Heterogeneous Vehicular Edge Systems

Enhanced wireless communication improves the connectivity of vehicular networks in which vehicles are utilized as infrastructures for communication and computation. Thus, a new concept "Vehicular Edge Computing (VEC)" is formed. As VEC utilizes a collaborative multitude of near-user edge r...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 7; p. 1
Main Authors: Chen, Xiao, Thomas, Nigel, Zhan, Tianming, Ding, Jie
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.01.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Ad hoc networks
Algorithms
Computational fluid dynamics
Dynamic scheduling
Edge Computing
Fluid flow
Formal Modelling
Heuristic algorithms
Internet of Vehicles
Performance evaluation
Queues
Schedules
Scheduling
Scheduling Algorithm
Scheduling algorithms
Servers
Task analysis
Task scheduling
Vehicles
Wireless communications
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Enhanced wireless communication improves the connectivity of vehicular networks in which vehicles are utilized as infrastructures for communication and computation. Thus, a new concept "Vehicular Edge Computing (VEC)" is formed. As VEC utilizes a collaborative multitude of near-user edge resources (i.e. vehicles) in the Internet of Vehicles, the capability of these joint resources becomes heterogeneous especially in their movements. Therefore, one critical problem is how to efficiently schedule each task under such mobile environments. For the reason, we propose a hybrid dynamic scheduling scheme (HDSS) that has the ability to optimize the task scheduling dynamically based on the changeable system environments. HDSS provides a decision function (DF) to select a better-performed scheduling algorithm from two provided candidates: the queue-based dynamic scheduling (QDS) algorithm and the time-based dynamic scheduling (TDS). QDS coincides with the Join-the-Shortest Queue scheme, which decides the scheduling by sorting out a server with the shortest queue-length; nevertheless, TDS is novel scheme that is designed to implement task allocation by estimating the waiting time of each server in order to select a server with the fastest response. Finally, this research generates formal models of each scheduling algorithm and the hybrid scheduling scheme to conduct performance evaluation with a fluid flow approximation technique. The analysis results in a superior performance of HDSS in the unstable VEC environments.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2934890