Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks

Jing, Zewei; Yang, Qinghai; Qin, Meng; Kwak, Kyung Sup

doi:10.1109/pimrcw.2019.8880847

Cited by 6 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many previous works resolve the scheduling problem through spectrum allocation [14]- [17]. In [14], the authors randomly assign tasks to the edge servers by a greedy method.…”

Section: Related Workmentioning

confidence: 99%

“…The authors schedule tasks according to tasks' characteristics to minimize the completion time. Multi-Radio Access Technology (Multi-RAT) is employed in [17] for task partitioning. Their scheme assigns tasks to different edge servers based on the network conditions and the queue status.…”

Section: Related Workmentioning

confidence: 99%

“…In [14]- [17], only external scheduling is addressed. The cases of multicore are considered in [18]- [20] for the speed-up of the task execution.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Task Scheduling With Multicore Edge Computing in Dense Small Cell Networks

Lai

Shieh²,

Chen

2021

IEEE Access

View full text Add to dashboard Cite

As a reaction and complement to cloud computing, edge computing is a computing paradigm designed for low-latency computing. Edge servers, deployed at the boundary of the Internet, bridge those distributed end devices and the centralized cloud server, forming a harmonic architecture with low latency and balanced loadings. Elaborated task scheduling, including task assignment and processor dispatching, is essential to the success of edge computing systems in dense small cell networks. Plenty of issues need to be considered, such as servers' computing power, storage capacity, loadings, bandwidth and tasks' sizes, delays, partitionability, etc. This study contributes to the task scheduling for multicore edge computing environments. We first show that this scheduling problem is an NP-hard problem. An efficient and effective heuristic is then proposed to tackle the problem. Our Multicore Task assignment for maximum Rewards (MAR) scheme differs from most previous schemes in jointly considering all three critical factors: namely task partitionability, multicore, and task properties. A task's priority is decided by its cost function, which takes into account the task's size, deadline, partitionability, cores' loadings, processing power, and so forth. First, tasks from end devices are assigned to edge servers considering servers' loadings and storage. Next, tasks are assigned to the cores of the selected server. Simulations compare the proposed scheme with First-Come-First-Serve (FCFS), Shortest Task First (STF), Delay Priority Scheduling (DPS), and Green Greedy Algorithm (GGA). Simulations demonstrate that the task completion ratio can be significantly increased, and the number of aborted tasks can be greatly reduced. Compared with FCFS (First-Come-First-Serve), STF (Shortest Task First), DPS (Delay Priority Scheduling), and GGA (Green Greedy Algorithm), the improvement in task completion ratio for hotspots is up to 26%, 25%, 22%, and 9%, respectively.INDEX TERMS Task scheduling, edge computing, multicore.

show abstract

“…Many previous works resolve the scheduling problem through spectrum allocation [14]- [17]. In [14], the authors randomly assign tasks to the edge servers by a greedy method.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%