Several interconnection networks are based on the complete graph topology. Networks with a moderate size can be based on a single complete graph. However, large-scale networks such as Dragonfly and HyperX use, respectively, a hierarchical or a multi-dimensional composition of complete graphs. The number of links in these networks is huge and grows rapidly with their size. This paper introduces LACIN, a set of complete graph implementations that use identically indexed ports to link switches. This way of implementing the network reduces the complexity of its cabling and its routing. LACIN eases the deployment of networks for parallel computers of different scales, from VLSI systems to the largest supercomputers.

翻译：多种互连网络基于完全图拓扑构建。中等规模网络可采用单一完全图结构，而大规模网络（如Dragonfly和HyperX）则分别采用分层或多维组合的完全图架构。此类网络链路数量庞大且随规模增长急剧增加。本文提出LACIN——一种采用同索引端口连接交换机的完全图实现方案。该网络实现方式显著降低了布线复杂度与路由复杂性。LACIN简化了从VLSI系统到超大规模超级计算机等不同规模并行计算系统的网络部署。