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

被引：0
|
作者：
GE FangBin 1
2 Institute of China Electronic System Engineering
机构：
来源：
Science China(Information Sciences) | 2011年 / 54卷 / 07期
关键词：
shuffle-exchange network; sequence division; routing coding; transition sequence; educed sequence;
D O I：
暂无
中图分类号：
TP393.02 [];
学科分类号：
081201 ; 1201 ;
摘要：
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
页数：12
相关论文
共 50 条
  • [31] All-to-all personalized exchange in generalized shuffle-exchange networks
    Chou, Well Y.
    Chen, Chiuyuan
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (16-18) : 1669 - 1684
  • [32] Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
    Perennes, S
    DISCRETE APPLIED MATHEMATICS, 1998, 83 (1-3) : 247 - 262
  • [33] On the generalized shuffle-exchange problem
    Sun, Xiaoming
    Sun, Yuan
    Wu, Kewen
    Xia, Zhiyu
    PURE AND APPLIED MATHEMATICS QUARTERLY, 2022, 18 (06) : 2619 - 2645
  • [34] Non-blocking and self-routing properties of two-dimensional shuffle-exchange networks
    To, PP
    Lee, TT
    ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 1039 - 1044
  • [35] Generalized shuffle-exchange networks: Combinatorial and fault tolerant properties
    Liu, Hongfang
    Hsu, D. Frank
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 (05): : 717 - 733
  • [36] On the shuffle-exchange permutation network
    Bass, DW
    Sudborough, IH
    THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 165 - 171
  • [37] Determining the reliability importance of switching elements in the shuffle-exchange networks
    Bistouni, Fathollah
    Jahanshahi, Mohsen
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2019, 34 (04) : 448 - 476
  • [38] Permutation admissibility in shuffle-exchange networks with arbitrary number of stages
    Das, N
    Bezrukov, SL
    Menon, R
    FIFTH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1998, : 270 - 276
  • [39] Embedding de Bruijn, Kautz and shuffle-exchange networks in books
    Hasunuma, T
    Shibata, Y
    DISCRETE APPLIED MATHEMATICS, 1997, 78 (1-3) : 103 - 116
  • [40] SWITCHING STRATEGIES IN SHUFFLE-EXCHANGE PACKET-SWITCHED NETWORKS
    KUMAR, M
    DIAS, DM
    JUMP, JR
    IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (02) : 180 - 186
12345