On the rearrangeability of (2s-1)-stage nonsymmetric interconnection networks

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

C S R E A Press

Access Rights

info:eu-repo/semantics/closedAccess

Abstract

In this paper, the rearrangeability of nonsymmetric (2s-1)-stage interconnection networks is proved. The analysis done shows that the well-known conditions for the rearrangeability of the (2s-1)-stage symmetric networks are also sufficient for the rearrangeability of nonsymmetric ones. As an application, the obtained result is used to prove that the serial cascade of any two of the Omega (8), BF8 and BL8 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, omega, butterfly, baseline

Journal or Series

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Vols I-V

WoS Q Value

Scopus Q Value

Volume

Issue

Citation

Endorsement

Review

Supplemented By

Referenced By