光互连网络中排序算法研究

Study of routing algorithm in optical interconnect networks

通过对光互连网络排序算法的研究,提出利用二分法构造二分图依次确定内外节点开关的连接状态,得到可重排无阻塞的 Omega 网络, Banyan 网络和 Crossover 光网络,每种光互连网络都可实现 8×8 信号全排列无阻塞的输出和排序。针对二分法互连函数不一致的问题,继而采用优化的 Looping Algorithm 算法,生成路由标签确定各级节点开关的状态,从而得到互连函数相同结构简单性能优越的光网络。

This paper describes all kinds of sorting routing algorithms and the characteristics of each algorithm used in optical interconnect networks. By adopting the dichotomy algorithm to make the conjunction appearance of the outside and inside node switches one by one and optimizing the Looping Algorithm to construct the routing label and the conjunction appearance of all-level node switches, the rearrangement non-blocking Omega, Banyan and Crossover network could be obtained. Each optical interconnect network can realize 8×8 signal sequence and non-blocking output.