Theoretically Guaranteed Online Workload Dispatching for Deadline-Aware Multi-Server Jobs
Hailiang Zhao, Shuiguang Deng, Jianwei Yin, Schahram Dustdar, Albert, Y. Zomaya

TL;DR
This paper introduces a theoretically guaranteed online dispatching policy for deadline-aware multi-server jobs, optimizing resource allocation and outperforming baseline policies in simulations.
Contribution
It presents the first $ extit{ extbf{alpha}}$-competitive online dispatching policy for deadline-aware multi-server jobs with a formal proof of its competitiveness.
Findings
Policy is $ extit{ extbf{alpha}}$-competitive with $ extbf{ extit{alpha}} extgreater=2$
Outperforms baseline policies in simulation results
Effectively balances job utilities and cluster utility
Abstract
Multi-server jobs are imperative in modern computing clusters. A multi-server job has multiple task components and each of the task components is responsible for processing a specific size of workloads. Efficient online workload dispatching is crucial but challenging to co-located heterogeneous multi-server jobs. The dispatching policy should decide where to launch each task component instance of the arrived jobs and the size of workloads that each task component processes. Existing policies are explicit and effective when facing service locality and resource contention in both offline and online settings. However, when adding the deadline-aware constraint, the theoretical superiority of these policies could not be guaranteed. To fill the theoretical gap, in this paper, we design an -competitive online workload dispatching policy for deadline-aware multi-server jobs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Distributed and Parallel Computing Systems · Age of Information Optimization
