Product-shuffle networks: toward reconciling shuffles and butterflies
- 1 July 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 37-38, 465-488
- https://doi.org/10.1016/0166-218x(92)90152-z
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Achieving multigauge behavior in bit-serial SIMD architectures via emulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal emulations by butterfly-like networksJournal of the ACM, 1996
- Efficient Embeddings of Trees in HypercubesSIAM Journal on Computing, 1992
- A unified framework for off-line permutation routing in parallel networksTheory of Computing Systems, 1991
- Optimal embeddings of butterfly-like graphs in the hypercubeTheory of Computing Systems, 1990
- Group Action Graphs and Parallel ArchitecturesSIAM Journal on Computing, 1990
- Gray codes, Fast Fourier Transforms and hypercubesParallel Computing, 1988
- A logarithmic time sort for linear size networksJournal of the ACM, 1987
- 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