Permuting data with the Omega network

DOI10.1007/BF00289714zbMath0559.68037MaRDI QIDQ2265809

Jacques Lenfant, Serge Tahé

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

multiprocessor architectureSIMD computerOmega network

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (3)

Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks ⋮ Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks ⋮ A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations by Cutting and Shuffling
• An Easily Controlled Network for Frequently Used Permutations
• The Prime Memory System for Array Access
• A Shuffle-Exchange Network with Simplified Control
• Access and Alignment of Data in an Array Processor
• Array Permutation by Index-Digit Permutation
• Implementation of Permutation Functions in Illiac IV-Type Computers
• Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks
• Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
• Theoretical Limitations on the Efficient Use of Parallel Memories
• The ILLIAC IV Computer
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Permuting data with the Omega network