让大模型推理任务按语义重要性排队,关键请求更快响应
Semantic Scheduling for LLM Inference
- 根据任务语义重要性动态调整调度优先级
- 在医疗应急场景中显著降低关键请求等待时间
- 适合对延迟敏感的实时应用,如紧急救援系统
传统操作系统调度算法大多忽略内容语义,仅基于延迟或公平性等指标决策,难以优先处理紧急或高重要性任务(如应急管理)。近年来语言模型的发展使过程语义分析成为可能,推动更智能的上下文感知调度。本文提出面向大模型推理请求的语义调度概念,利用任务语义决定调度优先级。设计了一种最优时间复杂度的新调度算法,旨在最小化大模型提示请求的整体等待时间。通过一个医疗应急管理系统应用实例,验证了该方法在关键时敏任务中的有效性。代码与数据已公开于 https://github.com/Wenyueh/latency_optimization_with_priority_constraints。
原文摘要 · Abstract (English)
Conventional operating system scheduling algorithms are largely content-ignorant, making decisions based on factors such as latency or fairness without considering the actual intents or semantics of processes. Consequently, these algorithms often do not prioritize tasks that require urgent attention or carry higher importance, such as in emergency management scenarios. However, recent advances in language models enable semantic analysis of processes, allowing for more intelligent and context-aware scheduling decisions. In this paper, we introduce the concept of semantic scheduling in scheduling of requests from large language models (LLM), where the semantics of the process guide the scheduling priorities. We present a novel scheduling algorithm with optimal time complexity, designed to minimize the overall waiting time in LLM-based prompt scheduling. To illustrate its effectiveness, we present a medical emergency management application, underscoring the potential benefits of semantic scheduling for critical, time-sensitive tasks. The code and data are available at https://github.com/Wenyueh/latency_optimization_with_priority_constraints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。