SLOpt: Serving Real-Time Inference Pipeline With Strict Latency Constraint
The rise of Machine Learning as a Service (MLaaS) has driven the demand for complex and customized real-time inference tasks, often requiring cascading multiple deep neural network (DNN) models into inference pipelines. However, these pipelines pose significant challenges due to scheduling complexity, particularly in maintaining strict latency service level objectives (SLOs). Existing systems serve pipelines with model-independent scheduling policies, which ignore the unique workload characteristics introduced by model cascading in the inference pipeline, leading to SLO violations and resource inefficiencies. In this paper, we propose that the serving system should exploit the model-cascading nature and inter-model workload dependency of the inference pipeline to ensure strict latency SLO cost-effectively. Based on this, we design and implement <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SLOpt</monospace> , a serving system optimized for real-time inference pipelines with a three-stage co-design of workload estimation, resource provisioning, and request execution. <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SLOpt</monospace> proposes cascade workload estimation and ahead-of-time tuning, which together address the challenge of cascade blocking and head-of-line blocking in workload estimation and resource provisioning. <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SLOpt</monospace> further implements an adaptive batch drop policy to mitigate latency amplification issues within the pipeline. These innovations enable <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SLOpt</monospace> to reduce the 99th percentile latency (P99 latency) by 1.4 to 2.5 times compared to the state of the arts while lowering serving costs by up to 29%. Moreover, to achieve comparable P99 latency, <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SLOpt</monospace> requires up to 70% less cost than existing systems. Extensive evaluations on a 64-GPU cluster demonstrate <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SLOpt</monospace> ’s effectiveness in meeting strict P99 latency SLOs under diverse real-world workloads.
Authors
- Xiulong Liu (ORCID: https://orcid.org/0000-0002-4746-5599)
- Wenyu Qu (ORCID: https://orcid.org/0000-0003-4817-5187)
- Laiping Zhao (ORCID: https://orcid.org/0000-0003-1967-2192)
- Wenxin Li (ORCID: https://orcid.org/0000-0001-8507-0339)
- Zhixin Zhao (ORCID: https://orcid.org/0009-0009-7865-4905)
- Yitao Hu (ORCID: https://orcid.org/0009-0004-0458-0900)
- Chen Shen (ORCID: https://orcid.org/0009-0002-1444-1272)
- Guang Yu Yang (ORCID: https://orcid.org/0009-0003-6392-6468)
- Zhenhua Gong (ORCID: https://orcid.org/0009-0002-1699-8592)
Institutions
- Tianjin University (CN)
Publication Details
- Journal
- IEEE Transactions on Computers
- Published
- 2025-01-10
- DOI
- https://doi.org/10.1109/tc.2025.3528125
- Citations
- 1
- Primary Topic
- Context-Aware Activity Recognition Systems
- Type
- article
- Field-Weighted Citation Impact
- 1.28