The performance of crossbar-based binary hypercubes

Wormhole routing is an attractive routing technique offering low latency communication without the need to buffer an entire packet in a single node. A new queueing-theoretic model for obtaining throughput and latency of binary hypercubes supporting wormhole routing is developed here. The model is very accurate in predicting the performance of an actual multicomputer over a range of network sizes, packet lengths, and input port priority mappings. Utilizing the model, the performance of networks with identical topologies but different node architectures is estimated