arXiv:2606.13501cs.DCcs.LG2026-06

动态调整扩散模型并行度,显著提升生成效率与资源利用率。

GF-DiT: Scheduling Parallelism for Diffusion Transformer Serving

论文配图:GF-DiT: Scheduling Parallelism for Diffusion Transformer Serving
图 1 · 摘自论文原文
  • 将并行配置作为可调度资源,按需动态调整
  • 吞吐最高提升6.01倍,平均延迟降低95%
  • 适合高并发图像/视频生成服务场景

扩散变换器(DiT)已成为图像和视频生成的主流架构,对高效服务提出更高要求。现有系统为每个请求分配固定并行配置,但DiT工作负载在请求间、执行阶段和系统条件上存在显著异质性,静态并行导致GPU利用率低、服务质量差。本文提出GF-DiT,一个可编程的弹性服务运行时,根据负载需求和服务目标动态调整请求的并行度。通过引入异步执行抽象,将请求分解为可独立调度的轨迹任务,并支持在线GPU重分配。为实现弹性并行,还提出无分组集体通信机制,支持任意执行组的低开销在线构建与重构。我们在vLLM-Omni中实现GF-DiT,评估其在典型图像和视频扩散工作负载下的表现。相比静态并行的固定流水线执行,GF-DiT将吞吐量最高提升6.01倍,平均延迟降低95%,SLO违反率下降90%,通信组建立开销从778毫秒降至约60微秒。代码已开源:https://github.com/SJTU-Liquid/GF-DiT。

原文摘要 · Abstract (English)

Diffusion Transformers (DiTs) have become the dominant architecture for image and video generation, creating growing demand for efficient DiT serving. Existing systems assign each request a fixed parallel configuration throughout its lifetime. However, DiT workloads exhibit substantial heterogeneity across requests, execution stages, and system conditions, making static parallelism inefficient and often leading to poor GPU utilization and degraded service quality. This paper argues that DiT serving should treat GPU parallelism as a first-class schedulable resource. We present GF-DiT, a policy-programmable runtime for elastic DiT serving that dynamically adapts the parallelism of running requests according to workload demands and service objectives. GF-DiT introduces an asynchronous execution abstraction that decomposes requests into independently schedulable trajectory tasks and enables online GPU reallocation. To make elastic parallelism practical, GF-DiT further proposes group-free collectives, a lightweight communication abstraction that supports low-overhead online formation and reconfiguration of arbitrary execution groups. We implement GF-DiT in vLLM-Omni and evaluate it on representative image and video diffusion workloads. Compared with fixed-pipeline execution with static parallelism, GF-DiT improves throughput by up to 6.01$\times$, reduces mean latency by up to 95%, lowers SLO violation rates by up to 90%, and reduces communication-group setup overhead from 778 ms to approximately 60 $μ$s. Our code is available at https://github.com/SJTU-Liquid/GF-DiT.

扩散模型并行调度服务优化

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