An optimal algorithm for permutation admissibility to multistage interconnection networks

DOI10.1109/12.376176MaRDI QIDQ4419690zbMATH OpenOpenAlexFDO

Authors Mao Xu, Xiangzu Wang, Xiaojun Shen

Publication date 15 October 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.376176

zbMATH Keywords

adversary strategytransition matrix

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks
• Fast permutation routing in a class of interconnection networks
• Permutation algorithms on optical multi-trees
• A fast parallel algorithm for routing in permutation networks
• Optimally routing LC permutations on k-extra-stage cube-type networks

Cited in

(9)

• Exploiting colored Petri nets to decide on permutation admissibility
• Efficient algorithms for checking the equivalence of multistage interconnection networks
• Permutation capability of optical multistage interconnection networks
• Permutation algorithms on optical multi-trees
• Optimal all-to-all personalized exchange in \(d\)-nary banyan multistage interconnection networks
• GSE: a full-access multistage interconnection network of arbitrary size
• Optimal realization of any BPC permutation on K-extra-stage Omega networks
• Optimally routing LC permutations on k-extra-stage cube-type networks
• An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks

This page was built for publication: An optimal algorithm for permutation admissibility to multistage interconnection networks

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