Cabinet Layout Optimization of Supercomputer Topologies for Shorter Cable Length
Cabinet Layout Optimization of Supercomputer Topologies for Shorter Cable Length
复制标题
超级计算机拓扑的机柜布局优化以缩短电缆长度
DOI：
10.1109/pdcat.2012.86
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
H. Casanova
中科院分区：
文献类型：
--
作者：
I. Fujiwara;M. Koibuchi;H. Casanova
随着超级计算机规模的增加，电缆总长度变得巨大，例如多达数千公里。最近的高基交换机具有数十个端口，这使得交换机布局和系统封装变得更加复杂。在这项研究中，我们研究了以减少电缆长度为目标的机房地板上交换机的物理布局的优化。对于给定的拓扑，使用图聚类算法将交换机逻辑分组到机柜中，从而使机柜间电缆的数量较少。然后，我们将机柜映射到物理楼层空间，以最大限度地减少电缆总长度。这是通过将映射问题建模和优化为设施选址问题来实现的。我们的评估结果表明，与标准的集群/映射方法相比，对于流行的网络拓扑，我们的集群方法可以减少高达40.3%的机柜间电缆数量，我们的映射方法可以将机架间电缆长度减少39.6%。
As the scales of supercomputers increase total cable length becomes enormous, e.g., up to thousands of kilometers. Recent high-radix switches with dozens of ports make switch layout and system packaging more complex. In this study, we study the optimization of the physical layout of topologies of switches on a machine room floor with the goal of reducing cable length. For a given topology, using graph clustering algorithms, we group switches logically into cabinets so that the number of inter-cabinet cables is small. Then, we map the cabinets onto a physical floor space so as to minimize total cable length. This is done by modeling and optimizing the mapping problem as a facility location problem. Our evaluation results show that, when compared to standard clustering/mapping approaches and for popular network topologies, our clustering approach can reduce the number of inter-cabinet cables by up to 40.3% and our mapping approach can reduce the inter-rack cable length by up to 39.6%.