The performance of crossbar-based binary hypercubes

DOI10.1109/12.467695zbMATH Open1031.68510OpenAlexW2126510139MaRDI QIDQ4421169FDOQ4421169

Authors: Frank T. Hady, Bernard Menezes 

Publication date: 10 November 2003

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

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

Recommendations

• Performability of the hypercube (reliability)
• Area-efficient VLSI layouts for binary hypercubes
• Crossbar-based interconnection networks. Blocking, scalability, and reliability
• Performance of hypercube architecture with shared memory
• High-performance switching based on buffered crossbar fabrics

zbMATH Keywords

routingwormhole routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (6)

• A performance model of pipelined k-ary n-cubes
• A new modelling approach of wormhole-switched networks with finite buffers
• Fibonacci hypercube
• Hypercube communication delay with wormhole routing
• A mathematical model of deterministic wormhole routing in hypercube multicomputers using virtual channels
• Network performance under bimodal traffic loads

This page was built for publication: The performance of crossbar-based binary hypercubes

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