A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks

DOI10.1016/0167-6377(89)90006-0zbMath0684.68041OpenAlexW2070173082WikidataQ122937457 ScholiaQ122937457MaRDI QIDQ1825642

Frank K. Hwang

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90006-0

zbMATH Keywords

parallel computingSIMDrearrangeabilityMIMDomega networkShuffle-exchange networks

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8
• Proving the Rearrangeability of Connecting Networks by Group Calculations
• Access and Alignment of Data in an Array Processor
• Parallel Processing with the Perfect Shuffle

This page was built for publication: A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks