Theoretical Latency of Topologies
Each point-to-point link requires one hardware unit
Each point-to-point communication requires one time unit
Topology Cost Latency
Complete graph Q(n2) Q(1)
Crossbar Q(n2) Q(1)
1-D Bus Q(n) Q(1)
2-D Mesh Q(n) Q( n )
3-D Mesh Q(n) Q( n )
Tree Q(n) Q(log n)
N-cube Q(n log n) Q(log n)
Previous slide
Next slide
Back to first slide
View graphic version