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 ve...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1995-10, Vol.44 (10), p.1208-1215
Main Authors: Hady, F.T., Menezes, B.L.
Format: Article
Language:English
Subjects:
Analytical models
Applied sciences
Computational modeling
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Delay
Exact sciences and technology
Hypercubes
Interconnected networks
Laplace equations
Networks and services in france and abroad
Performance analysis
Predictive models
Routing
Software
Software engineering
Switches
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Throughput
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.467695