The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks
From MaRDI portal
Publication:5087836
DOI10.1142/S0129626418500019zbMath1490.68039OpenAlexW2795699330WikidataQ124915002 ScholiaQ124915002MaRDI QIDQ5087836
Publication date: 4 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626418500019
Cites Work
- Optimal-depth sorting networks
- Sorting nine inputs requires twenty-five comparisons
- Sorting in \(c \log n\) parallel steps
- New Bounds on Optimal Sorting Networks
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- On a Class of Multistage Interconnection Networks
- Parallel Algorithms to Set Up the Benes Permutation Network
- Access and Alignment of Data in an Array Processor
- A new self-routing permutation network
- Optimal Sorting Networks
- Parallel Processing with the Perfect Shuffle