可重排网络的控制算法
Control Algorithms for the Rearrangeable Switching Network
-
摘要: 可重排网络是能实现任意置换而级数又最少的多级互连网络.本文将对这种网络的各类控制算法进行综合分析,并从实现置换特性和时间复杂性来比较它们的优劣.Abstract: The rearrangeable switching network can realize the arbitrary permutation and has least number of stages to compare with other multistage interconnection networks.In this paper,some kinds of the control algorithms for this network are described and analyzed,and their advantages and disadvantages are discussed from the point of view of permutation properties and time complexity.
下载: