A new routing algorithm for a class of rearrangeable networks

DOI10.1109/12.324560zbMath1061.68589OpenAlexW2132837221MaRDI QIDQ4419800

Tse-Yun Feng, Seung-Woo Seo

Publication date: 1994

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

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

zbMATH Keywords

destination-tag schemeinterchangeable group

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Computer system organization (68M99)

Related Items (2)

Rearrangeability of bit permutation networks ⋮ A new policy to solve routing conflicts in shuffle-exchange networks

This page was built for publication: A new routing algorithm for a class of rearrangeable networks