Optimal emulations by butterfly-like networks
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 43 (2) , 293-330
- https://doi.org/10.1145/226643.226658
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Work-preserving emulations of fixed-connection networksJournal of the ACM, 1997
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- An approach to emulating separable graphsTheory of Computing Systems, 1994
- Product-shuffle networks: toward reconciling shuffles and butterfliesDiscrete Applied Mathematics, 1992
- Embedding of Grids into Optimal HypercubesSIAM Journal on Computing, 1991
- Optimal embeddings of butterfly-like graphs in the hypercubeTheory of Computing Systems, 1990
- Topological properties of hypercubesIEEE Transactions on Computers, 1988
- A unified theory of interconnection network structureTheoretical Computer Science, 1986
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981