Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks

DOI10.1007/978-3-540-89985-3_15MaRDI QIDQ3628472zbMATH OpenOpenAlexFDO

Authors Saeedeh Bakhshi, Hamid Sarbazi-Azad

Publication date 20 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89985-3_15

zbMATH Keywords

interconnection networksmultilayer grid modelThompson grid modelVLSI layoutWK-pyramidWK-recursive

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• Compact grid layouts of multi-level networks
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
• Super spanning connectivity on WK-recursive networks
• VLSI layout of Benes networks

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 52113 (Why is no real title available?)

This page was built for publication: Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks

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