Paleyfly:一种可扩展的高速互连网络拓扑结构

高速互连网络是高性能计算系统的重要组成部分.随着网络规模需求的扩大，如何搭建更大规模的网络是高速互连网络拓扑结构设计的关键.因此，提出一种新型层次化的拓扑结构Paleyfly(PF)，其结合了Paley图强正则的特性和Random Regular(RR)图支持任意规模大小的特点.相比其他新型高速互连网络拓扑结构，Paleyfly能够有效解决在路由芯片端口数受限的背景下，Dragonfly(DF)可扩展性受限、Fat tree(Ft)物理成本高、RR结构物理布局难、路由表规模大等问题.同时，根据强正则属性在路由策略上负载均衡的优势，提出了4种路由策略来解决网络的拥塞问题.最后，通过模拟器实验比较分析PF结构与其他拓扑结构及PF结构不同路由策略的性能，验证了PF结构在不同规模以及不同通信模式配置下网络延迟优于RR结构.

Paleyfly: A Scalable Topology in High Performance Interconnection Network

High performance interconnection network is one of the most important parts in high performance computing system. How to design the topology of interconnection networks is the key point for the development of larger scale networks. Therefore, we contribute a new hierarchical topology structure Paleyfly (PF), which not only utilizes the property of strong regular graph with Paley graph but also supports the continued scale like Random Regular (RR) graph. Compared with other new high performance interconnection networks, Paleyfly can solve the problems of the scalability of Dragonfly (DF), the physical cost of Fat tree (Ft), the wiring complexity and the storage for routing table of Random Regular and so on. Meanwhile, according to the property of strong regular graph for load-balanced routing algorithm, we propose four routing algorithms to deal with congestion. Finally, through the simulation we briefly analyze the performance of Paleyfly comparing with other kinds of topologies and different routing algorithms. Experimental results show that our topology can achieve better effect compared with Random Regular under the various scales of network and different traffic patterns.