The Universality of the Shuffle-Exchange Network
From MaRDI portal
Publication:3914896
DOI10.1109/TC.1981.1675790zbMath0463.94016MaRDI QIDQ3914896
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
parallel processing; routing algorithms; interconnection network; perfect shuffle; omega network; permutation network
68N25: Theory of operating systems
Related Items
Universality of iterated networks, A new policy to solve routing conflicts in shuffle-exchange networks, Communication complexity of PRAMs, A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network, Interpolation between bases and the shuffle exchange network, Algorithms for parallel memory, I: Two-level memories, Topological properties of the recursive Petersen architecture