Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
- 1 September 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (9) , 861-863
- https://doi.org/10.1109/tc.1983.1676335
Abstract
It is shown that for d-way shuffle graphs all oblivious algorithms for realizing permutations in logarithmic time send packets along routes twice as long as the diameter of the graph. This confirms the optimality of the strategy that sends packets to random nodes in a first phase and to the correct destinations in the second. For the shuffle-exchange graph the corresponding route length is shown to be strictly longer than for the 2-way shuffle.Keywords
This publication has 12 references indexed in Scilit:
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- Parallel Algorithms to Set Up the Benes Permutation NetworkIEEE Transactions on Computers, 1982
- Routing, merging and sorting on parallel models of computationPublished by Association for Computing Machinery (ACM) ,1982
- Efficient schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1982
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- An efficient general purpose parallel computerPublished by Association for Computing Machinery (ACM) ,1981
- Interconnection Networks for SIMD MachinesComputer, 1979
- A Large Scale, Homogenous, Fully Distributed Parallel Machine, IIPublished by Association for Computing Machinery (ACM) ,1977
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971