Online job dispatching and scheduling in edge-clouds

• Published in: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications pp. 1 - 9
• Main Authors: Haisheng Tan, Zhenhua Han, Xiang-Yang Li, Lau, Francis C. M.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2017
• Subjects: Algorithm design and analysis; Cloud computing; Dispatching; Mobile communication; Mobile handsets; Servers; Time factors
• DOI: 10.1109/INFOCOM.2017.8057116

In edge-cloud computing, a set of edge servers are deployed near the mobile devices such that these devices can offload jobs to the servers with low latency. One fundamental and critical problem in edge-cloud systems is how to dispatch and schedule the jobs so that the job response time (defined as the interval between the release of a job and the arrival of the computation result at its device) is minimized. In this paper, we propose a general model for this problem, where the jobs are generated in arbitrary order and times at the mobile devices and offloaded to servers with both upload and download delays. Our goal is to minimize the total weighted response time over all the jobs. The weight is set based on how latency sensitive the job is. We derive the first online job dispatching and scheduling algorithm in edge-clouds, called OnDisc, which is scalable in the speed augmentation model; that is, OnDisc is (1 + ε)-speed O(1/ε)-competitive for any constant ε ϵ (0,1). Moreover, OnDisc can be easily implemented in distributed systems. Extensive simulations on a real-world data-trace from Google show that OnDisc can reduce the total weighted response time dramatically compared with heuristic algorithms.