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 条
  • [31] Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time
    Bilke, Andreas
    Cooper, Colin
    Elsaesser, Robert
    Radzik, Tomasz
    PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 451 - 453
  • [32] Minimum Cut in O(m log2 n) Time
    Gawrychowski, Pawel
    Mozes, Shay
    Weimann, Oren
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (04) : 814 - 834
  • [33] Online List Labeling: Breaking the log2 n Barrier
    Bender, Michael A.
    Conway, Alex
    Farach-Colton, Martin
    Komlos, Hanna
    Kuszmaul, William
    Wein, Nicole
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 980 - 990
  • [34] An O(log2 k)-competitive algorithm for metric bipartite matching
    Bansal, Nikhil
    Buchbinder, Niv
    Gupta, Anupam
    Naor, Joseph
    ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 522 - +
  • [35] TREVR2: illuminating fast N log2 N radiative transfer
    Wadsley, James W.
    Baumschlager, Bernhard
    Shen, Sijing
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2024, 528 (02) : 3767 - 3781
  • [36] Online Bipartite Matching with Amortized O(log2 n) Replacements
    Bernstein, Aaron
    Holm, Jacob
    Rotenberg, Eva
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 947 - 959
  • [37] Online Bipartite Matching with Amortized O(log2 n) Replacements
    Bernstein, Aaron
    Holm, Jacob
    Rotenberg, Eva
    JOURNAL OF THE ACM, 2019, 66 (05)
  • [38] ON THE REARRANGEABILITY OF 2(LOG2 N) - 1 STAGE PERMUTATION NETWORKS.
    Le, Kyungsook Yoon
    IEEE Transactions on Computers, 1985, C-34 (05) : 412 - 425
  • [39] rORAM: Efficient Range ORAM with O(log2 N) Locality
    Chakraborti, Anrin
    Aviv, Adam J.
    Choi, Seung Geol
    Mayberry, Travis
    Roche, Daniel S.
    Sion, Radu
    26TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2019), 2019,
  • [40] Monotone Boolean dualization is in co-NP[log2 n]
    Kavvadias, DJ
    Stavropoulos, EC
    INFORMATION PROCESSING LETTERS, 2003, 85 (01) : 1 - 6
12345