AN OPTIMAL ALGORITHM FOR PERMUTATION ADMISSIBILITY TO MULTISTAGE INTERCONNECTION NETWORKS

被引：11
|
作者：
SHEN, XJ
XU, M
WANG, XZ
机构：
[1] Computer Science Telecommunications Program, University of Missouri-Kansas City, Kansas City, MO 64110
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1995年 / 44卷 / 04期
关键词：
ADVERSARY STRATEGY; MULTISTAGE INTERCONNECTION NETWORK; PERMUTATION ADMISSIBILITY; TRANSITION MATRIX; WINDOW METHOD;
D O I：
10.1109/12.376176
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper introduces a simple O(NlogN) sequential algorithm that determines the admissibility of an arbitrary permutation to an N x N Multistage Cube-Type Network (MCTN) implemented by 2 X 2 switching elements (SEs) in contrast to previous O(Nlog(2)N) algorithms. It is proven that the new algorithm is optimal in the sense that any algorithm, based on bit-operations, has to examine at least (N/4)logN different bits among the total NlogN bits in the binary representations of the destinations numbered from 0 through N - 1.
引用
收藏
页码：604 / 608
页数：5
相关论文
共 50 条
12345