A new routing algorithm for the shuffle-exchange permutation network

DOI10.1007/S11424-006-0586-2MaRDI QIDQ2461324zbMATH OpenOpenAlexFDO

Authors Baoxing Chen, Wenjun Xiao, Ni Du

Publication date 27 November 2007

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-006-0586-2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
• A fast parallel algorithm for routing in permutation networks
• An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network
• scientific article; zbMATH DE number 975342
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks

Cites work

• A group-theoretic model for symmetric interconnection networks
• Dense Trivalent Graphs for Processor Interconnection
• Routing in a class of Cayley graphs of semidirect products of finite groups
• SEP: a fixed degree regular network for massively parallel systems
• Study of general incomplete star interconnection networks
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey

Cited in

(6)

• EFFICIENT ROUTING ALGORITHMS FOR GENERALIZED SHUFFLE-EXCHANGE NETWORKS
• A shuffle-based alternative to the ADM interconnection architecture
• A new policy to solve routing conflicts in shuffle-exchange networks
• Fast permutation routing in a class of interconnection networks
• A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
• Shuffle-ring: A new constant-degree network

This page was built for publication: A new routing algorithm for the shuffle-exchange permutation network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461324)