Online SLA-Aware Multi-Resource Allocation for Deadline Sensitive Jobs in Edge-Clouds

With the explosive growth of mobile applications and high computation burden on each single device, more and more end users demand to offload expensive computing tasks to external sites via job offloading technologies. Due to the fluctuating nature of jobs from end users, traditional cloud computing paradigm, however, has difficulties in accommodating highly dynamic job requests and meeting heterogeneous user requirements. Locating close to mobile users, edge-clouds have the potential to complement the cloud computing platform by acting as an efficient spot to perform users' deadline-sensitive tasks. In this paper, we study the resource allocation problem for accommodating deadline-sensitive jobs in edge-cloud system. We formulate a revenue maximization problem that captures the SLA- oriented property of job execution, and propose an efficient online multi-resource allocation algorithm that achieves low competitive ratio with moderate resource augmentation.

[1]  Axel Keller,et al.  The virtual resource manager: an architecture for SLA-aware resource management , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[2]  Ee-Chien Chang,et al.  Competitive Online Scheduling with Level of Service , 2001, COCOON.

[3]  Ishai Menache,et al.  Efficient online scheduling for deadline-sensitive jobs: extended abstract , 2013, SPAA.

[4]  Nodari Vakhania,et al.  Preemptive scheduling in overloaded systems , 2003, J. Comput. Syst. Sci..

[5]  James R. Larus,et al.  Zeta: scheduling interactive services with partial execution , 2012, SoCC '12.

[6]  Adam Wierman,et al.  This Paper Is Included in the Proceedings of the 11th Usenix Symposium on Networked Systems Design and Implementation (nsdi '14). Grass: Trimming Stragglers in Approximation Analytics Grass: Trimming Stragglers in Approximation Analytics , 2022 .

[7]  Ashish Goel,et al.  Multi-processor scheduling to minimize flow time with ε resource augmentation , 2004, STOC '04.

[8]  Randy H. Katz,et al.  Heterogeneity and dynamicity of clouds at scale: Google trace analysis , 2012, SoCC '12.

[9]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[10]  Ivona Brandic,et al.  Energy-efficient and SLA-aware management of IaaS clouds , 2012, 2012 Third International Conference on Future Systems: Where Energy, Computing and Communication Meet (e-Energy).

[11]  Jean-Marc Menaud,et al.  SLA-Aware Virtual Resource Management for Cloud Infrastructures , 2009, 2009 Ninth IEEE International Conference on Computer and Information Technology.

[12]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[13]  Ness B. Shroff,et al.  Forget the Deadline: Scheduling Interactive Applications in Data Centers , 2015, 2015 IEEE 8th International Conference on Cloud Computing.

[14]  Peng Liu,et al.  ParaDrop: Enabling Lightweight Multi-tenancy at the Network’s Extreme Edge , 2016, 2016 IEEE/ACM Symposium on Edge Computing (SEC).

[15]  Ness B. Shroff,et al.  Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[16]  Joseph Naor,et al.  Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters , 2012, SPAA '12.

[17]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.