期刊文献+

基于正规序列的Omega网络路由构造方法 被引量:2

Method of Constructing Routing Based on Normal Sequence in Omega Networks
下载PDF
导出
摘要 在混洗交换网络中,窗口检测法涉及的多窗口之间复杂的制约关系对无冲突路由的构造形成严重阻碍。为克服这一阻碍,提出正规序列概念,在此基础上给出构造无冲突路由的新依据——序列检测法。该方法将2n-1级Omega网络中无冲突路由的构造转化为单个序列的构造,与传统的窗口检测法相比,新方法不仅缩小了构造对象的空间规模,而且降低了构造对象的复杂度,为更方便地构造混洗交换网络路由创造了条件。 Constructing conflict-free routings is seriously prevented due to complex window restrictions of window de- tection in shuffle-exchange networks. In order to overcome this obstacle, the concept of normal sequence was proposed, and a new method called sequence detection which is used to construct conflict-free routings is offered based on the con- cept. This method translates constructing conflict-free routing into constructing a single sequence in 2n--1 stages Ome- ga networks, which reduces complexity and the size of space of object constructed relative to window detection. So, con- structing conflict-free routings becomes simpler.
出处 《计算机科学》 CSCD 北大核心 2014年第1期192-195,201,共5页 Computer Science
关键词 混洗交换网络 Omega网络 可重排性 正规序列 序列检测法 Shuffle exchange network, Omega network, Rearrangeability, Normal sequence, Sequence detection
  • 相关文献

参考文献3

二级参考文献45

  • 1STONE H S. Parallel processing with the perfect shuffie[J].IEEE Transactions on Computers, 1971, C-20(2): 153-161.
  • 2LAWRIE D H. Access and alignment of data in an array processor[J]. IEEE Transactions on Computers, 1975, C-24(10): 1145-1155.
  • 3LANG T, STONE H S. A shuffle-exchange net- work with simplified control[J]. IEEE Transactions on Computers, 1976, C-25(1): 55-65.
  • 4LANG T. Interconnections between processors and memory modules using the shuffle-exchange network[J]. IEEE Transactions on Computers, 1976,C-25(5): 496-503.
  • 5LEE K Y. On the rearrangeablity of the 2(log2 N)-lstage permutation network[J]. IEEE Transactions on Computers, 1985, C-34(5): 412-425.
  • 6RAGHAVENDRA C S, VARMA A. Rearrangeability of the 5-stage shuffle-exchange network for N=8[A]. Proceedings of 1986 International Conference on Parallel Proceeding[C]. University Park, USA, 1987. 119-122.
  • 7KIM K, RAGHAVENDRA C S. A simple algorithm to route arbitrary permutations on 8-imput 5-stage shuffle-exchange network[A]. Proceedings of 5th International Parallel Processing Symposium[C]. Beverly Hills, USA, 1991.398-403.
  • 8SOVIS E On rearrangeable networks of the shuffle-exchange network[A]. Proc of Frontiers of Massively Parallel Computation[C]. College Park, USA, 1990.304-314.
  • 9ABDENNADHER A, FENG T. On rearrangeability of Omega-Omega networks[A]. Proc 1992 International Conference on Parallel Proc[C]. University of Michigan, USA, 1992. 159-165.
  • 10HASAN C. Rearrangeablity of 2n-I stage shuffle-exchange networks[J]. SIAM Comp, 2003, 32(3):557-585.

共引文献7

同被引文献18

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部