立方晶格的对称互连网络
Symmetric Interconnection Networks from Cubic Crystal Lattices
摘要:
中等程度的环面网络在超级计算机行业中得到了广泛的应用。Tori在用于执行需要近邻通信的应用程序时非常出色。然而,他们在处理全球通信时并不那么好。因此,除了其他原因之外,典型的3D实现已经演进到5D网络,以减少网络距离。这些大型系统中的大多数都是混合基数环面,这不是最小化距离和有效利用网络资源的最佳选择。本文的重点是改善这些网络的拓扑性质。通过使用积分矩阵来处理阿贝尔群上的凯莱图,我们已经能够提出和分析一族高维的基于网格的互连网络。由于它们是建立在$n$维网格上的,这些网格诱导了空间的规则平铺,因此这些拓扑被表示为\textsl{lattice graphs}。我们将重点介绍用于建模对称3D网络的立方晶格。其他更高维的网络可以在这些图上组成,如本研究所示。简单的网络分区也可以利用这种网络组合操作。最小路由算法也提供了这些新的拓扑结构。最后,讨论了一些实际问题,如可执行性和初步性能评估。
英文摘要:
Torus networks of moderate degree have been widely used in the supercomputer industry. Tori are superb when used for executing applications that require near-neighbor communications. Nevertheless, they are not so good when dealing with global communications. Hence, typical 3D implementations have evolved to 5D networks, among other reasons, to reduce network distances. Most of these big systems are mixed-radix tori which are not the best option for minimizing distances and efficiently using network resources. This paper is focused on improving the topological properties of these networks. By using integral matrices to deal with Cayley graphs over Abelian groups, we have been able to propose and analyze a family of high-dimensional grid-based interconnection networks. As they are built over $n$-dimensional grids that induce a regular tiling of the space, these topologies have been denoted \textsl{lattice graphs}. We will focus on cubic crystal lattices for modeling symmetric 3D networks. Other higher dimensional networks can be composed over these graphs, as illustrated in this research. Easy network partitioning can also take advantage of this network composition operation. Minimal routing algorithms are also provided for these new topologies. Finally, some practical issues such as implementability and preliminary performance evaluations have been addressed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。