Interconnection networks N input Log(N) stages with N/2 modules per stage Example: Omega(shuffle exchange network) 0000 2010 3011 4567 11 0 17 Notice the order of inputs into a stage is a shuffle of the outputs from the previous stage:(0, 4, 1, 5, 2, 6, 3, 7) Easily extended to more stages Any output can be reached from any input by proper switch settings Not all routes can be done simultaneously Exactly one route between each SD pair Self-routing networkInterconnection networks • N input • Log(N) stages with N/2 modules per stage Example: Omega (shuffle exchange network) 0 1 2 3 4 5 6 7 0 000 1 001 2 010 3 011 4 100 5 101 6 110 7 117 • Notice the order of inputs into a stage is a shuffle of the outputs from the previous stage: (0,4,1,5,2,6,3,7) • Easily extended to more stages • Any output can be reached from any input by proper switch settings – Not all routes can be done simultaneously – Exactly one route between each SD pair Eytan Modiano – Self-routing network Slide 8