A method of batching conflict routings in shuffle-exchange networks

DOI10.1016/j.tcs.2013.12.003zbMath1279.68023OpenAlexW2054166559MaRDI QIDQ393894

Min Dong, Yi-Hao Zhang, Yi-Min Jiang, Yue-Hong Shen

Publication date: 24 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.003

zbMATH Keywords

eigenfunctionshuffle-exchange networkcovering functionleast no-conflict routing groupingmaximal no-conflict routing group

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• A new policy to solve routing conflicts in shuffle-exchange networks
• Interpolation between bases and the shuffle exchange network
• Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8
• Access and Alignment of Data in an Array Processor
• Parallel Processing with the Perfect Shuffle