arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.10468cs.NI
收藏

重新配置还是不重新配置:在光子互连中优化全对全集体通信

To Reconfigure or Not to Reconfigure: Optimizing All-to-All Collectives in Circuit-Switched Photonic Interconnects

Princeton University(普林斯顿大学);Purdue University(普渡大学)

Anchengcheng Zhou, Vamsi Addanki, Maria Apostolaki

AI总结:

本文提出了一种在光子互连中优化全对全通信的方法,通过拓扑结构和流调度的联合优化,减少完成时间达44%。

摘要:

全对全集体通信是分布式机器学习和高性能计算中的核心基础构件。在服务器层面,这些工作负载的通信需求正日益超出电气互连的带宽和能量限制,推动了对光子互连的兴趣增长。然而,利用这些互连进行全对全通信是非平凡的。核心挑战在于联合优化一系列拓扑结构和流调度,仅在传输节省通过较短路径超过重新配置成本时才重新配置。然而,这种联合优化的搜索空间极大。现有工作绕过这一挑战,通过做出不现实的重新配置成本假设,使得重新配置总是或从不值得。在本文中,我们证明任何拓扑结构和流调度的候选序列都可以表示为邻接矩阵及其幂的和。这种抽象捕捉了整个解决方案空间,并给出了全对全完成时间的下界。基于此公式,我们识别出一个具有强对称性和高扩张性的拓扑序列家族,其允许带宽高效的调度,我们的算法以低计算开销构建这些调度。这些见解共同使我们能够高效地构建近最优解,从而有效避免了组合设计空间的枚举。评估显示,我们的方法在广泛网络参数、消息大小和工作负载类型上,将全对全完成时间减少了高达44%。

英文摘要:

All-to-all collective communication is a core primitive in distributed machine learning and high-performance computing. At the server scale, the communication demands of these workloads are increasingly outstripping the bandwidth and energy limits of electrical interconnects, driving a growing interest in photonic interconnects. However, leveraging these interconnects for all-to-all communication is nontrivial. The core challenge lies in jointly optimizing a sequence of topologies and flow schedules, reconfiguring only when the transmission savings from traversing shorter paths outweigh the reconfiguration cost. Yet the search space of this joint optimization is enormous. Existing work sidesteps this challenge by making unrealistic assumptions on reconfiguration costs so that it is never or always worthwhile to reconfigure. In this paper, we show that any candidate sequence of topologies and flow schedules can be expressed as a sum of adjacency matrices and their powers. This abstraction captures the entire solution space and yields a lower bound on all-to-all completion time. Building on this formulation, we identify a family of topology sequences with strong symmetry and high expansion that admits bandwidth-efficient schedules, which our algorithm constructs with low computational overhead. Together, these insights allow us to efficiently construct near-optimal solutions, effectively avoiding enumeration of the combinatorial design space. Evaluation shows that our approach reduces all-to-all completion time by up to 44% on average across a wide range of network parameters, message sizes and workload types.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑