A Self-Routing Benes Network and Parallel Permutation Algorithms
From MaRDI portal
Cited in
(18)- Optimal routing algorithms for mesh-connected processor arrays
- Routing automorphisms of the hypercube
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- Geometric problems on two-dimensional array processors
- Hypercube permutations routable under all dimension orderings
- Selection on rectangular meshes with multiple broadcasting
- HISTOGRAMMING ON A RECONFIGURABLE MESH COMPUTER∗
- MAPPING TREE-STRUCTURED COMPUTATIONS ONTO MESH-CONNECTED ARRAYS OF PROCESSORS
- TIME-OPTIMAL GEOMETRIC ALGORITHMS IN HYPERCUBIC NETWORKS
- Parallel geometric algorithms on a mesh-connected computer
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
- A layout for the shuffle-exchange network with theta(N^ 2 /log N) area
- Routings for involutions of a hypercube
- Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
- Methods for message routing in parallel machines
- Massively parallel computations on many-variable polynomials
- Parallel general prefix computations with geometric, algebraic, and other applications
- Optical implementation of rearrangeable nonblocking double banyan interconnection network in free space
This page was built for publication: A Self-Routing Benes Network and Parallel Permutation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914895)