VLSI layout of Benes networks

DOI10.1080/09720529.2007.10698132MaRDI QIDQ5446251zbMATH OpenOpenAlexFDO

Authors Paul Manuel, Kalim Qureshi, Albert William, Muthumalai

Publication date 6 March 2008

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2007.10698132

zbMATH Keywords

butterfly networkVLSI layout problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• A tight layout of the butterfly network
• Compact grid layouts of multi-level networks
• Regular layouts of butterfly networks
• An efficient representation of Benes networks and its applications
• On VLSI layouts of the star graph and related networks

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• A tight layout of the butterfly network
• Achromatic number is NP-complete for cographs and interval graphs
• Bandwidth and density for block graphs
• Compact grid layouts of multi-level networks
• On the bisection width and expansion of butterfly networks
• The complexity of harmonious colouring for trees

Cited in

(6)

• Compact grid layouts of multi-level networks
• Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks
• Generalization of edge general position problem
• Laying out the interconnection network of the transpose bijection
• An efficient representation of Benes networks and its applications
• Regular layouts of butterfly networks

This page was built for publication: VLSI layout of Benes networks

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