Area-efficient VLSI layouts for binary hypercubes

DOI10.1109/12.833112MaRDI QIDQ4571351zbMATH OpenOpenAlexFDO

Authors Alpesh Patel, Anthony J. Kusalik, Carl McCrosky

Publication date 9 July 2018

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

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

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)

Cited in

(4)

• A Separator Theorem for Chordal Graphs
• The performance of crossbar-based binary hypercubes
• Mathematical Performance Modelling of Stretched Hypercubes
• Complete binary trees embeddings in Möbius cubes

This page was built for publication: Area-efficient VLSI layouts for binary hypercubes

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