A new policy to solve routing conflicts in shuffle-exchange networks

被引：0

作者：

FangBin Ge

Min Zhao

Tao Zhang

JianXin Wang

机构：

[1] College of Command Automation PLA University of Science and Technology,

[2] Institute of China Electronic System Engineering,undefined

来源：

Science China Information Sciences | 2011年 / 54卷

关键词：

shuffle-exchange network; sequence division; routing coding; transition sequence; educed sequence;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Batch routing is an important approach for solving routing conflicts in SE (shuffle-exchange) networks. However, the complexity of batching and the uncertainty of batch size makes this approach impracticable. Based on sequence division and routing coding concepts, we propose a method for detecting routing conflicts in an SE network, known as dividing detection that is more efficient than the method for window detection. In addition, a new conjecture relating to routing policies in SE networks is proposed. This is proved using a constructive approach when n < 6. Based on the conjecture, a new routing scheme for SE networks is provided. Using this scheme, all the input signals can be transfered without conflicts and within two batches, while the efficiency of the batch routing is noticeably improved.

引用

页码：1512 / 1523

页数：11

共 50 条

[21] Strict nonblockingness of reduced shuffle-exchange networks
Hwang, FK
Zhang, BW
NETWORKS, 2005, 45 (01) : 4 - 8
[22] A routing algorithm using graphical model for 5-stage shuffle-exchange networks
Kim, Y
Indugula, VS
INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1344 - 1348
[23] A method of batching conflict routings in shuffle-exchange networks
Zhang, Yi-Hao
Shen, Yue-Hong
Dong, Min
Jiang, Yi-Min
THEORETICAL COMPUTER SCIENCE, 2014, 522 : 24 - 33
[24] AWG-Based Nonblocking Shuffle-Exchange Networks
Ye, Tong
Ding, Jingjie
Lee, Tony T.
Maier, Guido
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (06) : 2699 - 2712
[25] AUGMENTED SHUFFLE-EXCHANGE MULTISTAGE INTERCONNECTION NETWORKS.
Kumar, Vijay P.
Reddy, Sudhakar M.
1600, (20):
[26] A MATHEMATICAL ABSTRACTION OF THE REARRANGEABILITY CONJECTURE FOR SHUFFLE-EXCHANGE NETWORKS
HWANG, FK
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) : 85 - 87
[27] FAULT-TOLERANT DEBRUIJN AND SHUFFLE-EXCHANGE NETWORKS
BRUCK, J
CYPHER, R
HO, CT
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (05) : 548 - 553
[28] THEORY AND CONSTRUCTION OF THE SHUFFLE-EXCHANGE TYPE PERMUTATION NETWORKS
SOVIS, F
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1985, 4 (04): : 367 - 384
[29] THE UNIVERSALITY OF THE SHUFFLE-EXCHANGE NETWORK
WU, C
FENG, T
IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (05) : 324 - 332
[30] Bidirectional shuffle-exchange network, and tag-based routing algorithm
Chen, Z
Liu, ZJ
Qiu, ZL
IEEE COMMUNICATIONS LETTERS, 2003, 7 (03) : 121 - 123

← 1 2 3 4 5 →