Saved in:
Bibliographic Details
Main Authors: Pang, Bowen, Li, Kai, She, Ruifeng, Wang, Feifan
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.15763
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929731168894976
author Pang, Bowen
Li, Kai
She, Ruifeng
Wang, Feifan
author_facet Pang, Bowen
Li, Kai
She, Ruifeng
Wang, Feifan
contents With the development of large language models (LLMs), it has become increasingly important to optimize hardware usage and improve throughput. In this paper, we study the inference optimization of the serving system that deploys LLMs. To optimize system throughput and maximize hardware utilization, we formulate the inference optimization problem as a mixed-integer programming (MIP) model and propose a hybrid offline-online method as solution. The offline method improves large-scale inference systems by introducing a Minimizing Makespan Bin Packing Problem. We further provide a theoretical lower bound computation method. Then, we propose an online sorting and preemptive scheduling method to better utilize hardware. In the online iteration scheduling process, a Lagrangian method is applied to evaluate the cost efficiency of inserting prefill stages versus decode stages at each iteration and dynamically determine when to preempt decoding tasks and insert prefill tasks. Experiments using real-world data from the LLaMA-65B model and the GSM8K dataset demonstrate that system utilization improves from 80.2% to 89.1%, and the total inference time decreases from 201.00 to 190.58 seconds. A 100-cases study shows that our method consistently outperforms the baseline method and improves the utilization rate by 8.0% on average. Finally, we discuss potential future extensions, including stochastic modeling, reinforcement learning-based schedulers, and dynamic decision-making strategies for system throughput and hardware utilization.
format Preprint
id arxiv_https___arxiv_org_abs_2502_15763
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Hybrid Offline-online Scheduling Method for Large Language Model Inference Optimization
Pang, Bowen
Li, Kai
She, Ruifeng
Wang, Feifan
Distributed, Parallel, and Cluster Computing
Artificial Intelligence
Hardware Architecture
Machine Learning
With the development of large language models (LLMs), it has become increasingly important to optimize hardware usage and improve throughput. In this paper, we study the inference optimization of the serving system that deploys LLMs. To optimize system throughput and maximize hardware utilization, we formulate the inference optimization problem as a mixed-integer programming (MIP) model and propose a hybrid offline-online method as solution. The offline method improves large-scale inference systems by introducing a Minimizing Makespan Bin Packing Problem. We further provide a theoretical lower bound computation method. Then, we propose an online sorting and preemptive scheduling method to better utilize hardware. In the online iteration scheduling process, a Lagrangian method is applied to evaluate the cost efficiency of inserting prefill stages versus decode stages at each iteration and dynamically determine when to preempt decoding tasks and insert prefill tasks. Experiments using real-world data from the LLaMA-65B model and the GSM8K dataset demonstrate that system utilization improves from 80.2% to 89.1%, and the total inference time decreases from 201.00 to 190.58 seconds. A 100-cases study shows that our method consistently outperforms the baseline method and improves the utilization rate by 8.0% on average. Finally, we discuss potential future extensions, including stochastic modeling, reinforcement learning-based schedulers, and dynamic decision-making strategies for system throughput and hardware utilization.
title Hybrid Offline-online Scheduling Method for Large Language Model Inference Optimization
topic Distributed, Parallel, and Cluster Computing
Artificial Intelligence
Hardware Architecture
Machine Learning
url https://arxiv.org/abs/2502.15763