Permuting data with the Omega network
Introduced by D. H. Lawrie, the Omega network is a powerful device to connect processing elements in a SIMD computer or in a multiprocessor architecture. Unfortunately it is not rearrangeable and some permutations that are frequently used to align data in a SIMD computer cannot be performed in one pass. Such is the case with the class of permutations induced by a permutation of index digits (PIPID) which includes the perfect shuffle, the bit reversal, etc.... Using the techniques of linear algebra over the two-element field, we show that PIPIDs can be achieved by the Omega network through which the vector of data is routed twice.
- A New Interconnection Network for SIMD Computers: The Sigma Network
- Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
- Optimal realization of any BPC permutation on K-extra-stage Omega networks
- scientific article; zbMATH DE number 3930907
- Notes on Shuffle/Exchange-Type Switching Networks
- A Shuffle-Exchange Network with Simplified Control
- Access and Alignment of Data in an Array Processor
- An Easily Controlled Network for Frequently Used Permutations
- Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks
- Array Permutation by Index-Digit Permutation
- scientific article; zbMATH DE number 3225079 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Implementation of Permutation Functions in Illiac IV-Type Computers
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
- Parallel Processing with the Perfect Shuffle
- Permutations by Cutting and Shuffling
- The ILLIAC IV Computer
- The Prime Memory System for Array Access
- Theoretical Limitations on the Efficient Use of Parallel Memories
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
- A one-copy algorithm for 2-D shuffles for optical omega networks
- Design and implementation of a circular omega network in the \({\mathbf EM}\)-4
- Permutation algorithms on optical multi-trees
- Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks
- scientific article; zbMATH DE number 3849135 (Why is no real title available?)
- Permuting streaming data using RAMs
- Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
- A Versatile Mechanism to Move Data in an Array Processor
- A New Interconnection Network for SIMD Computers: The Sigma Network
- A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
- Optimal realization of any BPC permutation on K-extra-stage Omega networks
This page was built for publication: Permuting data with the Omega network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265809)
