Self-routing in >2D shuffle networks by d-tuples

Josef Giglmayr

doi:10.1117/12.326784

9 October 1998 Self-routing in >2D shuffle networks by d-tuples

Josef Giglmayr

Proceedings Volume 3466, Algorithms, Devices, and Systems for Optical Information Processing II; (1998) https://doi.org/10.1117/12.326784
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

Abstract

Massive parallel optical interconnection systems in the 3-D physical space offer advantages but they also represent serious difficulties caused by the increase of the degree of freedom. These difficulties are mainly (1) packaging and precise mounting but also (2) problems of combinatorial nature. Throughout the paper, the presentation of routing information in greater than or equal to 2-D MINs is discussed and the results are aimed to avoid delay and additional hardware. The results apply to distributed switching and processing under the optical interconnection regime.

Citation Download Citation

Josef Giglmayr "Self-routing in >2D shuffle networks by d-tuples", Proc. SPIE 3466, Algorithms, Devices, and Systems for Optical Information Processing II, (9 October 1998); https://doi.org/10.1117/12.326784

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