arXiv:2603.00356cs.DCcs.LG2026-03被引 1

用令牌池统一管理多租户推理资源,兼顾性能保障与利用率。

Token Management in Multi-Tenant AI Inference Platforms

  • 引入令牌池抽象,以令牌吞吐、缓存等为单位量化推理能力
  • 在负载高峰时通过限流非优先任务,确保关键任务延迟稳定在P99内
  • 支持不同服务等级和公平调度,无需修改底层推理引擎

多租户AI推理平台需在动态需求下平衡资源利用率与服务质量承诺。传统方法存在缺陷:专用端点导致空闲模型占资源,而速率限制忽略请求执行成本的异构性。本文提出「令牌池」这一控制平面抽象,将推理能力以原生单位(如令牌吞吐、KV缓存、并发数)明确表示。相比仅控制请求准入的速率限制,令牌池同时授权请求准入与自动扩缩容,确保承诺与实际供给一致。该机制可捕捉跨多维度的突发流量,通过每项额度的动态限流实现精细资源管控,并允许低优先级任务在空闲时回填资源。设计支持优先级分配、差异化服务等级及基于债务的公平调度,且无需修改底层推理运行时或集群调度器。在使用vLLM后端的Kubernetes集群上实验显示,令牌池能在过载时通过选择性限流突发流量,维持关键任务的有界P99延迟;而无准入控制的基线则导致所有任务延迟无界恶化。另一实验表明,在资源稀缺时,弹性任务间能通过债务机制快速收敛至公平共享状态,满足异构SLO要求。

原文摘要 · Abstract (English)

Multi-tenant AI inference platforms must balance resource utilization against service-level guarantees under variable demand. Conventional approaches fail to achieve this balance: dedicated endpoints strand capacity on idle models, while rate limits ignore the heterogeneous cost of inference requests. We introduce \emph{token pools}, a control-plane abstraction that represents inference capacity as explicit entitlements expressed in inference-native units (token throughput, KV cache, concurrency). Unlike rate limits, which govern request admission without regard to execution cost, token pools authorize both admission and autoscaling from the same capacity model, ensuring consistency between what is promised and what is provisioned. The abstraction captures burst modes across multiple dimensions invisible to conventional throttling. Dynamic per-entitlement limits on each burst dimension enable fine-grained control over resource consumption while permitting work-conserving backfill by low-priority traffic. The design supports priority-aware allocation, service tiers with differentiated guarantees, and debt-based fairness mechanisms, all without modifying the underlying inference runtime or cluster scheduler. In experiments on a Kubernetes cluster with vLLM backends, token pools maintain a bounded P99 latency for guaranteed workloads during overload by selectively throttling spot traffic, while a baseline without admission control experiences unbounded latency degradation across all workloads. A second experiment demonstrates debt-based fair-share convergence among elastic workloads with heterogeneous SLO requirements during capacity scarcity.

多租户推理优化资源管理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。