A unified framework for off-line permutation routing in parallel networks
- 1 December 1991
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 24 (1), 233-251
- https://doi.org/10.1007/bf02090401
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Group Action Graphs and Parallel ArchitecturesSIAM Journal on Computing, 1990
- Fast algorithms for bit-serial routing on a hypercubePublished by Association for Computing Machinery (ACM) ,1990
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- Fault tolerance in hypercube-derivative networksPublished by Association for Computing Machinery (ACM) ,1989
- Strategies for interconnection networks: Some methods from graph theoryJournal of Parallel and Distributed Computing, 1986
- Interconnection Networks Based on a Generalization of Cube-Connected CyclesIEEE Transactions on Computers, 1985
- The Extra Stage Cube: A Fault-Tolerant Interconnection Network for SupersystemsIEEE Transactions on Computers, 1982
- A Construction for Vertex-Transitive GraphsCanadian Journal of Mathematics, 1982
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- A Study of Non-Blocking Switching NetworksBell System Technical Journal, 1953