Parallel Processing with the Perfect Shuffle

DOI10.1109/T-C.1971.223205zbMath0214.42703MaRDI QIDQ5617294

Publication date: 1971

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68M01: General theory of computer systems

Related Items

An approach to emulating separable graphs, Universality of iterated networks, GSE: a full-access multistage interconnection network of arbitrary size, Exposing graph uniformities via algebraic specification, Optimal three-dimensional VLSI layouts, Unnamed Item, Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers, PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM, The shuffle exchange network has a Hamiltonian path, Balanced permutations and multistage interconnection networks, Simulating the Bitonic Sort Using P Systems, Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees, Rotator design, Optimal parallel algorithms for computing convex hulls and for sorting, A generalization of the zero-one principle for sorting algorithms, A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures, A generalization of the perfect shuffle, A new parallel sorting algorithm based upon min-mid-max operations, A hardware independent parallel programming model, An optimal time bound for oblivious routing, Small-diameter Cayley graphs for finite simple groups, The mathematics of perfect shuffles, A multiprocess network logic with temporal and spatial modalities, Topological transformations as a tool in the design of systolic networks, A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network, An introduction to parallelism in combinatorial optimization, On recurrent and recursive interconnection patterns, A VLSI algorithm for sorting variable-length character strings, Routing, merging, and sorting on parallel models of computation, Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs, Array processing machines: an abstract model, Self-routing control algorithms and the passability of random inputs by the base-line network, Optimal book embeddings of the FFT, Benes, and barrel shifter networks, Synthesis and equivalence of concurrent systems, Fault-tolerance VLSI sorters, Interpolation between bases and the shuffle exchange network, Noisy sort, a memory-intensive sorting algorithm, Parallel approximation algorithms for bin packing, FFT algorithms and their adaptation to parallel processing, Real-time emulations of bounded-degree networks, A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area, Parallel algorithms for the connected components and minimal spanning tree problems, Fast orthogonal derivatives on the STAR, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Trends in systolic and cellular computation, Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers, Product-shuffle networks: Toward reconciling shuffles and butterflies, Embedding meshes of trees into deBruijn graphs, Permutations on the block PRAM, A new approach to parallel computing, Realization of graceful permutation by a shuffle-exchange network, Deterministic sorting in nearly logarithmic time on the hypercube and related computers, A chained-matrices approach for parallel computation of continued fractions and its applications, Algorithms for parallel memory, I: Two-level memories, Fast parallel preconditioned conjugate gradient algorithms for robot manipulator dynamics simulation, A parallel algorithm for the generation of a permutation and applications, Sloping-and-shaking, Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three, Matrix transpose on meshes with wormhole and XY routing, Computing the cycles in the perfect shuffle permutation, Representing graph families with edge grammars, Solving the symmetric tridiagonal eigenvalue problem on hypercubes, Better understanding of Batcher's merging networks, A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks, An asymptotically optimal layout for the shuffle-exchange graph, Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram, Topological properties of the recursive Petersen architecture, Permuting data with the Omega network, A neural sorting network with O(1) time complexity, Permutation algorithms on optical multi-trees, Stride permutation networks for array processors, SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK, DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS, Permutation-exchange graphs that emulate the binary cube, Space-efficient parallel merging, Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram, A parallel sorting scheme whose basic operation sortsN elements, On vectorizing the fast fourier transform, On the construction of balanced matrices