Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8

DOI10.1109/TCOM.1987.1096867zbMath0643.94040MaRDI QIDQ3786428

Anujan Varma, Cauligi S. Raghavendra

Publication date: 1987

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

zbMATH Keywords

rearrangeable networksmultistage shuffle exchange network

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items

Rearrangeability of bit permutation networks, A new policy to solve routing conflicts in shuffle-exchange networks, Universality of iterated networks, A method of batching conflict routings in shuffle-exchange networks, Analyzing permutation capability of multistage interconnection networks with colored Petri nets, A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks