Harpagon: Minimizing DNN Serving Cost via Efficient Dispatching, Scheduling and Splitting
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918219970772992 |
|---|---|
| author | Zhao, Zhixin Hu, Yitao Gong, Ziqi Yang, Guotao Li, Wenxin Liu, Xiulong Li, Keqiu Wang, Hao |
| author_facet | Zhao, Zhixin Hu, Yitao Gong, Ziqi Yang, Guotao Li, Wenxin Liu, Xiulong Li, Keqiu Wang, Hao |
| contents | Advances in deep neural networks (DNNs) have significantly contributed to the development of real-time video processing applications. Efficient scheduling of DNN workloads in cloud-hosted inference systems is crucial to minimizing serving costs while meeting application latency constraints. However, existing systems suffer from excessive module latency during request dispatching, low execution throughput during module scheduling, and wasted latency budget during latency splitting for multi-DNN application, which undermines their capability to minimize the serving cost.
In this paper, we design a DNN inference system called Harpagon, which minimizes the serving cost under latency constraints with a three-level design. It first maximizes the batch collection rate with a batch-aware request dispatch policy to minimize the module latency. It then maximizes the module throughput with multi-tuple configurations and proper amount of dummy requests. It also carefully splits the end-to-end latency into per-module latency budget to minimize the total serving cost for multi-DNN applications. Evaluation shows that Harpagon outperforms the state of the art by 1.49 to 2.37 times in serving cost while satisfying the latency objectives. Additionally, compared to the optimal solution using brute force search, Harpagon derives the lower bound of serving cost for 91.5% workloads with millisecond level runtime. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06161 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Harpagon: Minimizing DNN Serving Cost via Efficient Dispatching, Scheduling and Splitting Zhao, Zhixin Hu, Yitao Gong, Ziqi Yang, Guotao Li, Wenxin Liu, Xiulong Li, Keqiu Wang, Hao Distributed, Parallel, and Cluster Computing Advances in deep neural networks (DNNs) have significantly contributed to the development of real-time video processing applications. Efficient scheduling of DNN workloads in cloud-hosted inference systems is crucial to minimizing serving costs while meeting application latency constraints. However, existing systems suffer from excessive module latency during request dispatching, low execution throughput during module scheduling, and wasted latency budget during latency splitting for multi-DNN application, which undermines their capability to minimize the serving cost. In this paper, we design a DNN inference system called Harpagon, which minimizes the serving cost under latency constraints with a three-level design. It first maximizes the batch collection rate with a batch-aware request dispatch policy to minimize the module latency. It then maximizes the module throughput with multi-tuple configurations and proper amount of dummy requests. It also carefully splits the end-to-end latency into per-module latency budget to minimize the total serving cost for multi-DNN applications. Evaluation shows that Harpagon outperforms the state of the art by 1.49 to 2.37 times in serving cost while satisfying the latency objectives. Additionally, compared to the optimal solution using brute force search, Harpagon derives the lower bound of serving cost for 91.5% workloads with millisecond level runtime. |
| title | Harpagon: Minimizing DNN Serving Cost via Efficient Dispatching, Scheduling and Splitting |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2412.06161 |