Delay-Driven Computation Task Scheduling in Multi-Cell Cellular Edge Computing Systems

6Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper studies the joint scheduling of subcarrier, base station, transmit power, and virtual machine in multi-cell cellular edge computing systems to minimize the total delay experienced by tasks of users. Traditional work considers the queue length based Lyapunov function and designs the corresponding scheduling algorithms. This work considers the delay based Lyapunov function. Firstly, the delay of the communication and computing queues in multi-cell cellular edge computing systems is modeled as the virtual delay queue based on which a delay based Lyapunov function is defined. Then, the joint subcarrier allocation, base station selection, power control, and virtual machine scheduling algorithms are proposed to minimize the conditional drift of the delay based Lyapunov function. Simulation results show the proposed scheduling algorithm performs better than the traditional queue length based one in the performance of total delay.

Cite

CITATION STYLE

APA

Zhang, Y., & Du, P. (2019). Delay-Driven Computation Task Scheduling in Multi-Cell Cellular Edge Computing Systems. IEEE Access, 7, 149156–149167. https://doi.org/10.1109/ACCESS.2019.2946843

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free