Self-routing in multistage networks based on nearest-neighbor interconnects

Josef Giglmayr

doi:10.1117/12.161319

1 November 1993 Self-routing in multistage networks based on nearest-neighbor interconnects

Josef Giglmayr

Proceedings Volume 2024, Multigigabit Fiber Communication Systems; (1993) https://doi.org/10.1117/12.161319
Event: SPIE's 1993 International Symposium on Optics, Imaging, and Instrumentation, 1993, San Diego, CA, United States

Abstract

Selfrouting in multistage interconnection networks (MINs) with nearest-neighbor (NN) interstage interconnects is applied by mapping the system onto an equivalent shuffle net. For this purpose, additional interconnects between the switches are introduced which provide a 1:1 mapping of shuffle MINs onto NN-MINs (and vice versa). Both homogeneous and inhomogeneous lay-outs of the interconnection system are applied. Examples are presented and discussed for the interconnection of 8 X 8 and 16 X 16 data arrays, respectively.

Citation Download Citation

Josef Giglmayr "Self-routing in multistage networks based on nearest-neighbor interconnects", Proc. SPIE 2024, Multigigabit Fiber Communication Systems, (1 November 1993); https://doi.org/10.1117/12.161319

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available