Compact grid layouts of multi-level networks

DOI10.1145/301250.301372MaRDI QIDQ2819578zbMATH OpenOpenAlexFDO

Authors S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp, Torsten Suel

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301250.301372

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• An optimal layout of multigrid networks
• VLSI layout of Benes networks
• Multilayer grid embeddings for VLSI
• Improved layout of the odd-even sorting network
• Optimal three-dimensional layout of interconnection networks

Cited in

(8)

• An optimal layout of multigrid networks
• Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks
• VLSI layout of Benes networks
• Nearly optimal three dimensional layout of hypercube networks
• Area efficient layouts of the Batcher sorting networks
• A general computational formalism for networks of structured grids
• scientific article; zbMATH DE number 1538536 (Why is no real title available?)
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout

This page was built for publication: Compact grid layouts of multi-level networks

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