Combinatorial model of the class of rearrangeable nonsymmetric interconnection networks
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
C S R E A Press
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
The rearrangeability of (2s-1)-stage nonsymmetric interconnection networks is proved. This result is used to show that two passes through some s-stsge networks, (2log(n)N-1)-stage nonsymmetric networks employing uniform connection pattern, and 2log(n)N-1 circulations through single-stage networks are rearrangeable.
Description
International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000) -- JUN 26-29, 2000 -- LAS VEGAS, NV
Keywords
interconnection network, rearrangeability, nonsymmetric, multistage, single-stage
Journal or Series
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Vols I-V
