The algorithm for rearrangements in the log2 (N, 0, p) fabrics with an odd number of stages

Wojciech Kabaciński; Marek Michalski

doi:10.1109/icc.2011.5963384

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Publications / The algorithm for rearrangements in the log2 (N, 0, p) fabrics with an odd number of stages

Submit a comment

Chapter

Download BibTeX

Title

The algorithm for rearrangements in the log2 (N, 0, p) fabrics with an odd number of stages

Authors

Wojciech Kabaciński (WEiT) ^{[ 1 ][ P ]}
Marek Michalski (WEiT) ^{[ 1 ][ P ]}

^{[ 1 ]} Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | ^{[ P ]} employee

Year of publication

2011

Chapter type

paper

Publication language

english

Abstract

EN This paper presents a new way of representing the internal states of the log2((N; 0; p) switching fabrics. Basing on this representation a new algorithm for rearrangements in such fabric was developed and is presented here. Also, the maximal number of rearrangements in the log2((N; 0; p) switching fabrics with odd number of stages is presented.

Pages (from - to)

1 - 5

DOI

10.1109/icc.2011.5963384

URL

https://ieeexplore.ieee.org/document/5963384

Book

IEEE International Conference on Communications (ICC)

Presented on

2011 IEEE International Conference on Communications (ICC), 5-9.06.2011, Kyoto, Japan

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS