EFFICIENT ROUTING ALGORITHMS FOR GENERALIZED SHUFFLE-EXCHANGE NETWORKS

DOI10.1142/S179383090900021XMaRDI QIDQ3397516zbMATH OpenFDO

Authors James K. Lan, Well Y. Chou, Chiuyuan Chen

Publication date 22 September 2009

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

multistage interconnection networkomega network

Mathematics Subject Classification ID

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

Recommendations

• A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
• A new routing algorithm for the shuffle-exchange permutation network
• All-to-all personalized exchange in generalized shuffle-exchange networks
• A new routing algorithm for a class of rearrangeable networks
• An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network

Cites work

• A unified theory of interconnection network structure

Cited in

(3)

• A method of batching conflict routings in shuffle-exchange networks
• All-to-all personalized exchange in generalized shuffle-exchange networks
• A new policy to solve routing conflicts in shuffle-exchange networks

This page was built for publication: EFFICIENT ROUTING ALGORITHMS FOR GENERALIZED SHUFFLE-EXCHANGE NETWORKS

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