A Self-Routing Benes Network and Parallel Permutation Algorithms
From MaRDI portal
Publication:3914895
DOI10.1109/TC.1981.1675791zbMath0463.94015MaRDI QIDQ3914895
David Nassimi, Sartaj K. Sahni
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
bit-permute-complement permutationscube connected computerinverse omega permutationsperfect shuffle computer
Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Algorithms in computer science (68W99)
Related Items (18)
Methods for message routing in parallel machines ⋮ Constant-slowdown simulations of normal hypercube algorithms on the butterfly network ⋮ Selection on rectangular meshes with multiple broadcasting ⋮ Geometric problems on two-dimensional array processors ⋮ HISTOGRAMMING ON A RECONFIGURABLE MESH COMPUTER∗ ⋮ MAPPING TREE-STRUCTURED COMPUTATIONS ONTO MESH-CONNECTED ARRAYS OF PROCESSORS ⋮ TIME-OPTIMAL GEOMETRIC ALGORITHMS IN HYPERCUBIC NETWORKS ⋮ Routing automorphisms of the hypercube ⋮ A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ Hypercube permutations routable under all dimension orderings ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ Optical implementation of rearrangeable nonblocking double banyan interconnection network in free space ⋮ Massively parallel computations on many-variable polynomials ⋮ Parallel geometric algorithms on a mesh-connected computer ⋮ Routings for involutions of a hypercube ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers ⋮ AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
This page was built for publication: A Self-Routing Benes Network and Parallel Permutation Algorithms
