Journal of Xidian University ›› 2024, Vol. 51 ›› Issue (6): 104-116.doi: 10.19665/j.issn1001-2400.20241004

• Computer Science and Technology & Cyberspace Security • Previous Articles     Next Articles

Cluster-oriented semi-online task scheduling method in the edge computing platform

HAN Jiaxi1,2(), ZHAO Hui1,2,3(), FENG Nanzhi1(), WANG Jing1(), WAN Bo1,2,3(), WANG Quan1,2()   

  1. 1. School of Computer Science and Technology,Xidian University,Xi’an 710071,China
    2. Shaanxi Province Key Laboratory of Smart Human-Computer Interaction and Wearable Technology,Xi’an 710071,China
    3. Hangzhou Institute of Technology,Xidian University,Hangzhou 311231,China
  • Received:2023-10-22 Online:2024-10-23 Published:2024-10-23
  • Contact: WANG Jing E-mail:22031212552@stu.xidian.edu.cn;hzhao@mail.xidian.edu.cn;20031211439@stu.xidian.edu.cn;wangjing@mail.xidian.edu.cn;wanbo@xidian.edu.cn;qwang@xidian.edu.cn

Abstract:

The existing task scheduling methods for edge computing do not consider the problem of uncertain performance of edge nodes caused by network delay,and cannot adapt to the delay sensitive edge computing platform with uncertain node performance.To solve this problem,this paper proposes a cluster-oriented semi-online scheduling method for delay-sensitive edge computing platform.First,considering the nodes with uncertain performance caused by network delay,a performance uncertainty metric is designed to represent the degree of performance certainty of edge nodes.This metric provides extra pieces of information for the semi-online scheduling algorithm.Second,a dual-objective QoS guarantee model and a task completion time optimization model are proposed to establish a dual-objective optimization model for task scheduling,which focuses on guaranteeing QoS and minimizing makespan.Third,to address the NP-hard problem of task scheduling,a mapping-based semi-online task scheduling algorithm(MSSA) is proposed which divides the service area range based on the performance uncertainty metric and user location,establishes a cluster-oriented edge computing platform model,and dynamically adjusts cluster capacity based on load changes,thus enabling efficient semi-online task scheduling.Finally,by using trace data from a real edge computing platform,simulation experiments are conducted to compare the proposed algorithm with other methods.Experimental results demonstrate that the proposed algorithm can reduce the task completion time by 26% and improves the QoS guarantee by 19%.

Key words: edge computing, scheduling algorithms, quality of service, makespan

CLC Number: 

  • TP301.6