Maximize Potential Reserved Task Scheduling for URLLC Transmission and Edge Computing

Emerging Internet of vehicles systems brings interesting new applications, such as VR entertainment systems in a car. These applications frequently generate data processing requirements and require a rapid response to ensure user experience. The combination of edge computing mode and ultra-low-latency communications (URLLC) traffic can better meet the requirements of the above scenarios. All requests for signal transmission and data processing can be considered a latency-limited task. We study scheduling strategies of these tasks intending to maximize overall utility for all users. We show that finding an optimal schedule for at least N tasks is NP-hard in the utility-maximizing issue. We propose a heuristic algorithm to maximize the overall utility of all users from the perspective of residual utility. To simulate the tolerance of delay for different tasks, we designed three utility curves: exponential, linear, and step. Simulation results show that the proposed algorithm outperforms the benchmark.

[1]  Fei Hu,et al.  Intelligent Vehicle Network Routing With Adaptive 3D Beam Alignment for mmWave 5G-Based V2X Communications , 2020, IEEE Transactions on Intelligent Transportation Systems.

[2]  Feng Xia,et al.  Deep Reinforcement Learning for Vehicular Edge Computing , 2019, ACM Trans. Intell. Syst. Technol..

[3]  Giorgio Buttazzo,et al.  Handling Transients of Dynamic Real-Time Workload Under EDF Scheduling , 2019, IEEE Transactions on Computers.

[4]  Honggang Zhang,et al.  Analysis of Multiple Clients’ Behaviors in Edge Computing Environment , 2018, IEEE Transactions on Vehicular Technology.

[5]  Gustavo de Veciana,et al.  Joint Scheduling of URLLC and eMBB Traffic in 5G Wireless Networks , 2017, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[6]  Shuhui Li,et al.  A 2-Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value , 2016, IEEE Transactions on Parallel and Distributed Systems.

[7]  Gregory A. Koenig,et al.  Utility Functions and Resource Management in an Oversubscribed Heterogeneous Computing Environment , 2015, IEEE Transactions on Computers.

[8]  Shuhui Li,et al.  Profit and Penalty Aware Scheduling for Real-Time Online Services , 2012, IEEE Transactions on Industrial Informatics.

[9]  Ali Movaghar-Rahimabadi,et al.  Performance Optimization Based on Analytical Modeling in a Real-Time System with Constrained Time/Utility Functions , 2011, IEEE Transactions on Computers.

[10]  Binoy Ravindran,et al.  On recent advances in time/utility function real-time scheduling and resource management , 2005, Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05).

[11]  Binoy Ravindran,et al.  Time-utility function-driven switched Ethernet: packet scheduling algorithm, implementation, and feasibility analysis , 2004, IEEE Transactions on Parallel and Distributed Systems.

[12]  Alan Burns,et al.  Dynamic value-density for scheduling real-time systems , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[13]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[14]  Ken Chen,et al.  A scheduling algorithm for tasks described by Time Value Function , 1996, Real-Time Systems.