The Algorithm for Rearrangements in the Log2(N,0,p) Fabrics with Odd Number of Stages

被引：7
|
作者：
Kabacinski, Wojciech [1 ]
Michalski, Marek [1 ]
机构：
[1] Poznan Univ Tech, Chair Commun & Comp Networks, PL-60965 Poznan, Poland
来源：
2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2011年
关键词：
D O I：
10.1109/icc.2011.5963384
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper presents a new way of representing the internal states of the log(2)(N,0,p) switching fabrics. Based on this representation a new algorithm for rearrangements in such fabrics was developed and is presented here. Also, the maximal number of rearrangements in the log(2)(N, 0, p) switching fabrics with an odd number of stages is presented.
引用
收藏
页数：5
相关论文
共 50 条
  • [21] Solving the Boltzmann equation in N log2 N
    Filbet, Francis
    Mouhot, Clement
    Pareschi, Lorenzo
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2006, 28 (03): : 1029 - 1053
  • [22] An O(n log2 n) algorithm for a sink location problem in dynamic tree networks
    Mamada, S
    Uno, T
    Makino, K
    Fujishige, S
    EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS, 2004, 155 : 251 - 264
  • [23] Expected Linear Time Sorting for Word Size Ω(log2 n log log n)
    Belazzougui, Djamal
    Brodal, Gerth Stolting
    Nielsen, Jesper Sindahl
    ALGORITHM THEORY - SWAT 2014, 2014, 8503 : 26 - +
  • [24] Mutual Exclusion with O(log2 log n) Amortized Work
    Bender, Michael A.
    Gilbert, Seth
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 728 - 737
  • [25] A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees
    Sand, Andreas
    Brodal, Gerth Stolting
    Fagerberg, Rolf
    Pedersen, Christian N. S.
    Mailund, Thomas
    BMC BIOINFORMATICS, 2013, 14
  • [26] An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
    Mamada, Satoko
    Uno, Takeaki
    Makino, Kazuhisa
    Fujishige, Satoru
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (16) : 2387 - 2401
  • [27] Nonblocking Multirate log2(N, m, p) Switching Networks with Multicast Connections
    Kabacinski, Wojciech
    Wichary, Tomasz
    NETWORKS, 2011, 57 (04) : 333 - 343
  • [28] Wide-sense nonblocking multicast Log2 (N, m, p) networks
    Hwang, FK
    Lin, BC
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (10) : 1730 - 1735
  • [29] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
    Mozes, Shay
    Wulff-Nilsen, Christian
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
  • [30] Comments on "wide-sense nonblocking multicast Log2 (N, m, p) networks"
    Danilewicz, Grzegorz
    Kabacinski, Wojciech
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (06) : 980 - 982
12345