{'fraction_non_alphanumeric': 0.019753086419753086, 'fraction_numerical': 0.0024691358024691358, 'mean_word_length': 5.3858267716535435, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A More Accurate Delay Model based Task Scheduling in Cellular Edge Computing Systems

This paper studies task scheduling for delay minimization in cellular edge computing systems. Existing works depend on the delay model implied by Little’s Law. However, that model could be inaccurate. This work designs scheduling algorithm without using Little’s Law. Firstly, a more accurate delay model for cellular edge computing systems is established. Then, a Lyapunov function of delay is defined based on which a novel task scheduling algorithm is proposed. Simulation results show that the proposed scheduling algorithm can further reduce the delay compared with the traditional scheduling algorithm. Specifically, the proposed scheduling algorithm can achieve maximum delay reduction of 55% for light-traffic users.