A general class of rearrangeable interconnection networks

DOI10.1109/26.120160zbMATH Open0742.94026OpenAlexW2117406955MaRDI QIDQ3987482FDOQ3987482

Authors: Riccardo Melen 

Publication date: 28 June 1992

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.120160

Recommendations

• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks
• scientific article; zbMATH DE number 1535258
• Reconfiguration Algorithms for Interconnection Networks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• Crosstalk-free rearrangeable multistage interconnection networks

zbMATH Keywords

Benes networkDelta networkrearrangeable interconnection networks

Mathematics Subject Classification ID

Circuits, networks (94C99)

Cited In (8)

• Title not available (Why is that?)
• Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
• Title not available (Why is that?)
• Crosstalk-free rearrangeable multistage interconnection networks
• A new routing algorithm for a class of rearrangeable networks
• Reconfiguration Algorithms for Interconnection Networks
• Title not available (Why is that?)
• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks

This page was built for publication: A general class of rearrangeable interconnection networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987482)