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 条

[41] All-to-All Personalized Exchange Algorithms in Generalized Shuffle-exchange Networks
Chou, Well Y.
Chen, Richard B.
Chen, Chiuyuan
2009 EIGHTH INTERNATIONAL CONFERENCE ON NETWORKS, 2009, : 185 - 190
[42] Rearrangeability of (2n-1)-stage shuffle-exchange networks
Çam, H
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) : 557 - 585
[43] A DIRECT ROUTING ALGORITHM FOR THE BIT-REVERSAL PERMUTATION ON A SHUFFLE-EXCHANGE NETWORK
BIRKHOFF, IJM
INFORMATION PROCESSING LETTERS, 1985, 21 (05) : 259 - 268
[44] IS THE SHUFFLE-EXCHANGE BETTER THAN THE BUTTERFLY
RAGHUNATHAN, A
SARAN, H
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 32 - 41
[45] A general packet replication scheme for multicasting with application to shuffle-exchange networks
Liew, SC
IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (08) : 1021 - 1033
[46] Matrix Shuffle-Exchange Networks for Hard 2D Tasks
Ozolins, Emils
Freivalds, Karlis
Sostaks, Agris
2021 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2021,
[47] SWITCHING STRATEGIES IN SHUFFLE-EXCHANGE PACKET-SWITCHED NETWORKS.
Kumar, Manoj
Dias, Daniel M.
Jump, J.R.
IEEE Transactions on Computers, 1985, C-34 (02) : 180 - 186
[48] HAMILTONIAN CYCLES IN THE SHUFFLE-EXCHANGE NETWORK
LIU, WT
HILDEBRANDT, TH
CAVIN, R
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (05) : 745 - 750
[49] SHUFFLE-EXCHANGE NETWORK WITH SIMPLIFIED CONTROL
LANG, T
STONE, HS
IEEE TRANSACTIONS ON COMPUTERS, 1976, 25 (01) : 55 - 65
[50] NEW CONNECTIVITY AND MSF ALGORITHMS FOR SHUFFLE-EXCHANGE NETWORK AND PRAM
AWERBUCH, B
SHILOACH, Y
IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (10) : 1258 - 1263

← 1 2 3 4 5 →