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 条
  • [41] Simple O(n log2 n) Algorithms for the Planar 2-Center Problem
    Tan, Xuehou
    Jiang, Bo
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 481 - 491
  • [42] The Metric Relaxation for 0-Extension Admits an Ω(log2/3 k) Gap
    Schwartz, Roy
    Tur, Nitzan
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1601 - 1614
  • [43] A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
    Bansal, Nikhil
    Buchbinder, Niv
    Gupta, Anupam
    Naor, Joseph
    ALGORITHMICA, 2014, 68 (02) : 390 - 403
  • [44] O(log2 k/log log k)-APPROXIMATION ALGORITHM FOR DIRECTED STEINER TREE: A TIGHT QUASI-POLYNOMIAL TIME ALGORITHM
    Grandonidagger, Fabrizio
    Laekhanukitddagger, Bundit
    Lis, Shi
    SIAM JOURNAL ON COMPUTING, 2023, 52 (02) : 298 - 322
  • [45] O(log2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
    Grandoni, Fabrizio
    Laekhanukit, Bundit
    Li, Shi
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 253 - 264
  • [46] Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
    Diks, Krzysztof
    Stanczyk, Piotr
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 321 - 333
  • [47] AN 0(N2 LOG N) RESTRICTION MAP COMPARISON AND SEARCH ALGORITHM
    MYERS, EW
    HUANG, XQ
    BULLETIN OF MATHEMATICAL BIOLOGY, 1992, 54 (04) : 599 - 618
  • [48] Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log2 n)-Time Algorithm
    Klein, Philip
    Mozes, Shay
    Weimann, Oren
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 236 - +
  • [49] Bounded fixed-parameter tractability and log2 n nondeterministic bits
    Flum, J
    Grohe, M
    Weyer, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (01) : 34 - 71
  • [50] A 2n2 - log2(n)-1 Lower Bound for the Border Rank of Matrix Multiplication
    Landsberg, Joseph M.
    Michalek, Mateusz
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2018, 2018 (15) : 4722 - 4733
12345