Processing math: 25%
Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing | IEEE Journals & Magazine | IEEE Xplore

Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing


Abstract:

Edge computing systems typically handle a wide variety of applications that exhibit diverse degrees of sensitivity to job latency. Therefore, a multitude of utility funct...Show More

Abstract:

Edge computing systems typically handle a wide variety of applications that exhibit diverse degrees of sensitivity to job latency. Therefore, a multitude of utility functions of the job response time need to be considered by the underlying job dispatching and scheduling mechanism. Nonetheless, previous studies in edge computing mainly focused on optimizing a single utility function across all jobs, e.g., linear, sigmoid, or the hard deadline. In this paper, we design online job dispatching and scheduling strategies in which different jobs can be categorized by different non-increasing utility functions. Our goal is to maximize the total utility of all scheduled jobs. We first prove that no online deterministic algorithm could achieve a competitive ratio better than the lower bound \Omega \left({\frac {1}{\sqrt {\epsilon }}}\right) under the (1+\epsilon) -speed augmentation model. We proceed to propose an online algorithm, named as O4A, for handling jobs with heterogeneous utilities. We prove that O4A is O\left({\frac {1}{\epsilon ^{2}}}\right) -competitive. We also design its distributed version, i.e., DO4A. We implement O4A and DO4A on an edge computing testbed running deep learning inference jobs. With the production trace from Google Cluster, our experimental and large-scale simulation results indicate that O4A can increase the total utility by up to 50% compared with state-of-the-art methods. Besides, the performance loss of DO4A is only 2% compared with O4A with a small communication overhead involved. Moreover, both of our algorithms are robust to estimation errors in job processing time and transmission delay.
Published in: IEEE/ACM Transactions on Networking ( Volume: 31, Issue: 1, February 2023)
Page(s): 352 - 365
Date of Publication: 05 August 2022

ISSN Information:

Funding Agency:

No metrics found for this document.

I. Introduction

Emerging applications in the era of 5G, such as virtual/augmented reality and autonomous driving, require low-latency access to powerful computation resources [2], [3]. Edge computing is a promising technology by deploying servers at the Internet edge. In essence, the computing paradigm where mobile applications offload their latency-sensitive jobs to nearby edge servers can greatly extend the capability of mobile devices and enlarge the coverage of cloud computing.

Usage
Select a Year
2025

View as

Total usage sinceAug 2022:1,175
051015202530JanFebMarAprMayJunJulAugSepOctNovDec11281020130000000
Year Total:82
Data is updated monthly. Usage includes PDF downloads and HTML views.

Contact IEEE to Subscribe

References

References is not available for this document.