超越流量矩阵:DELTA——一种面向AIDC的DAG感知OCS逻辑拓扑优化
Beyond Traffic Matrix: DELTA -- A DAG-Aware OCS Logical Topology Optimization for AIDCs
AI总结:
提出DELTA框架,利用计算通信有向无环图(DAG)将时变流量模式编码为混合整数线性规划(MILP)模型,通过可变长度时间间隔公式和双轨加速策略优化光学电路开关(OCS)逻辑拓扑,减少通信时间并节省光端口。
摘要:
大型语言模型(LLM)的快速扩展加剧了AI数据中心(AIDC)中的通信瓶颈。为了克服这一问题,光学电路开关(OCS)因其优越的带宽容量和能效而被广泛采用。然而,它们的重配置开销阻碍了迭代内拓扑更新,需要先验地设计静态拓扑以吸收时变的LLM流量。现有方法基于流量矩阵设计这些拓扑,但这种表示掩盖了由并行化策略决定的突发并发带宽需求,并且未能考虑并发通信所需的独立通道。为了解决这个问题,我们提出了DELTA,一种高效的AIDC逻辑拓扑优化框架,它利用计算通信有向无环图(DAG)将时变流量模式编码为混合整数线性规划(MILP)模型,同时利用非关键任务的时间松弛来节省光端口而不影响迭代完成时间。通过首创可变长度时间间隔公式,DELTA相比固定时间步长公式显著减少了求解空间。为了扩展到千GPU集群,我们设计了一种双轨加速策略,结合搜索空间剪枝(将复杂度从二次降低到线性)和启发式热启动。在大规模LLM工作负载上的评估表明,与最先进的基于流量矩阵的基线相比,DELTA将通信时间减少了高达17.5%。此外,该框架将光端口消耗减少了至少20%;动态重新分配这些多余端口给带宽瓶颈工作负载,使其与理想非阻塞电网络的性能差距缩小了高达26.1%,最终使大多数工作负载实现接近理想的性能。
英文摘要:
The rapid scaling of large language models (LLMs) exacerbates communication bottlenecks in AI data centers (AIDCs). To overcome this, optical circuit switches (OCS) are increasingly adopted for their superior bandwidth capacity and energy efficiency. However, their reconfiguration overhead precludes intra-iteration topology update, necessitating a priori engineering of a static topology to absorb time-varying LLM traffic. Existing methods engineer these topologies based on traffic matrices. However, this representation obscures the bursty concurrent bandwidth demands dictated by parallelization strategies and fails to account for the independent channels required for concurrent communication. To address this, we propose DELTA, an efficient logical topology optimization framework for AIDCs that leverages the computation-communication directed acyclic graph (DAG) to encode time-varying traffic patterns into a Mixed-Integer Linear Programming (MILP) model, while exploiting the temporal slack of non-critical tasks to save optical ports without penalizing iteration makespan. By pioneering a variable-length time interval formulation, DELTA significantly reduces the solution space compared to the fixed-time-step formulation. To scale to thousand-GPU clusters, we design a dual-track acceleration strategy that combines search space pruning (reducing complexity from quadratic to linear) with heuristic hot-starting. Evaluations on large-scale LLM workloads show that DELTA reduces communication time by up to 17.5% compared to state-of-the-art traffic-matrix-based baselines. Furthermore, the framework reduces optical port consumption by at least 20%; dynamically reallocating these surplus ports to bandwidth-bottlenecked workloads reduces their performance gap relative to ideal non-blocking electrical networks by up to 26.1%, ultimately enabling most workloads to achieve near-ideal performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。