The Universality of the Shuffle-Exchange Network

DOI10.1109/TC.1981.1675790zbMath0463.94016OpenAlexW2136963271MaRDI QIDQ3914896

Chuanlin Wu, Tse-Yun Feng

Publication date: 1981

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

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

zbMATH Keywords

parallel processingrouting algorithmsinterconnection networkperfect shuffleomega networkpermutation network

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Algorithms for parallel memory, I: Two-level memories, Topological properties of the recursive Petersen architecture, A new policy to solve routing conflicts in shuffle-exchange networks, Interpolation between bases and the shuffle exchange network, Universality of iterated networks, Extending the Hong-Kung model to memory hierarchies, Communication complexity of PRAMs, A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network