A new policy to solve routing conflicts in shuffle-exchange networks

DOI10.1007/s11432-011-4256-1zbMath1267.68035OpenAlexW2084870526MaRDI QIDQ350906

Min Zhao, Fangbin Ge, Jianxin Wang, Tao Zhang

Publication date: 3 July 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4256-1

zbMATH Keywords

educed sequencerouting codingsequence divisionshuffle-exchange networktransition sequence

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A method of batching conflict routings in shuffle-exchange networks

Cites Work

• Unnamed Item
• Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
• Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8
• Rearrangeability of multistage shuffle/exchange networks
• Notes on Shuffle/Exchange-Type Switching Networks
• On a Class of Multistage Interconnection Networks
• The Universality of the Shuffle-Exchange Network
• The Counterfeit Coin Problem Revisited
• Proving the Rearrangeability of Connecting Networks by Group Calculations
• A new routing algorithm for a class of rearrangeable networks
• Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
• Parallel Processing with the Perfect Shuffle