Dana Vrajitoru
B424 Parallel and Distributed Programming

Parallel Networks Topologies

Interconnection Networks

Parallel Networks Topologies

Network Properties

More on Topologies

Full mesh Partial mesh

Complete Binary Tree
  • There is only one path between any two nodes.
  • Bottlenecks can happen at the top nodes. One can increase the number of switches at the top
  • Dynamic trees: leaf nodes for processing and intermediate ones as switches.
  • Diameter: 2*log(n)

Hypercube


Torus
  • Each node has 4 connections: E, W, N, S
  • The end nodes are connected in two directions
  • Diameter: sqrt(n)
  • Can scale up without adding a degree

Butterfly
  • k-ary n-fly has kn nodes.
  • Left: 2-ary 3-fly, connecting 8 nodes.
  • Routing is done based on the destination address.
  • Bit i used to select output port at stake i.

Dragonfly
  • Hierarchical clustering of nodes.
  • Nodes in each cluster have direct connections.
  • Bottlenecks happen between clusters.
  • High scalability.
  • Diameter: 3 (here), O(log(n)).

Improving Communication Overhead