On the number of permutations performable by extra-stage multistage interconnection networks

DOI10.1109/12.16509MaRDI QIDQ3817631zbMATH OpenOpenAlexFDO

Authors Israel Gazit, Miroslaw Malek

Publication date 1989

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

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

zbMATH Keywords

permutationshypercubegraph modelmultistage interconnection networksbanyan networkcombinatorial powerfault-tolerant networkextra-stage network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Recommendations

• Balanced permutations and multistage interconnection networks
• scientific article; zbMATH DE number 1334211
• scientific article; zbMATH DE number 3930907
• Some LCP decompositions of multistage interconnection networks
• Rearrangeability of multistage shuffle/exchange networks

Cited in

(2)

• Analyzing permutation capability of multistage interconnection networks with colored Petri nets
• Balanced permutations and multistage interconnection networks

This page was built for publication: On the number of permutations performable by extra-stage multistage interconnection networks

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