Indirect Networks or Dynamic Networks

Indirect Networks or Dynamic Networks
Interconnection Networks Indirect Networks or Dynamic Networks Guihai Chen …with major presentation contribution from José Flich, UPV (and Cell BE EIB slides by Tom Ainsworth, USC)

Questions in mind Difference between Static/direct and Dynamic/indirect Networks Why Multi-Stage Interconnection Networks Large Switch and Small Switch How to design non-blocking MINs 2

Outline Network Topology Preliminaries and Evolution
Centralized Switched (Indirect) Networks From non-blocking crossbar to blocking MINs From blocking MINs to non-blocking MINs 3

Network Topology Preliminaries and Evolution
One switch suffices to connect a small number of devices Number of switch ports limited by VLSI technology, power consumption, packaging, and other such cost constraints A fabric of interconnected switches (i.e., switch fabric or network fabric) is needed when the number of devices is much larger The topology must make a path(s) available for every pair of devices—property of connectedness or full access (What paths?) Topology defines the connection structure across all components Bisection bandwidth: the minimum bandwidth of all links crossing a network split into two roughly equal halves Full bisection bandwidth: Network BWBisection = Injection (or Reception) BWBisection= N/2 Bisection bandwidth mainly affects performance Topology is constrained primarily by local chip/board pin-outs; secondarily, (if at all) by global bisection bandwidth 4

Network Topology Preliminaries and Evolution
Several tens of topologies proposed, but less than a dozen used 1970s and 1980s Topologies were proposed to reduce hop count 1990s Pipelined transmission and switching techniques Packet latency became decoupled from hop count 2000s Topology still important (especially OCNs, SANs, P2P Overlays, DCNs) when N is high Topology impacts performance and has a major impact on cost 5

Network Topology Centralized Switched (Indirect) Networks
Crossbar network Crosspoint switch complexity increases quadratically with the number of crossbar input/output ports, N, i.e., grows as O(N2) Has the property of being non-blocking 7 6 5 4 3 2 1 7 6 5 4 3 2 1 Here, Centralized Switched Network means Indirect network. 6

Network Topology From Crossbar to MINs 7

Multistage interconnection networks (MINs) Crossbar split into several stages consisting of smaller crossbars Complexity grows as O(N × log N), where N is # of end nodes Inter-stage connections represented by a set of permutation functions 7 6 5 4 3 2 1 7 6 5 4 3 2 1 Omega topology, perfect-shuffle exchange 8

Network Topology Appendix Shuffle function N= 0…N-1
f(i)= 2i, when I <N/2 f(i)=(2i+1), mod N when i ≥ N/2 Often used as a connection pattern unshuffle function, also often used 7 6 5 4 3 2 1 7 6 5 4 3 2 1 Shuffle and Shift: What is their relation? Shuffle is actually the left-cyclic shift. perfect-shuffle unshuffle 9

0000 0000 0001 0001 0010 0010 0011 0011 0100 0100 0101 0101 0110 0110 0111 0111 1000 1000 1001 1001 1010 1010 1011 1011 1100 1100 1101 1101 1110 1110 1111 1111 16 port, 4 stage Omega network 10

0000 0000 0001 0001 0010 0010 0011 0011 0100 0100 0101 0101 0110 0110 0111 0111 1000 1000 What is the difference between Omega and Baseline? Which is better? Omega : not recursive; routing by comparing Source and Destination Baseline: recursive; routing only depending on Destination “Recursive” means large networks are composed of 2 or more small networks. 1001 1001 1010 1010 1011 1011 1100 1100 1101 1101 1110 1110 1111 1111 16 port, 4 stage Baseline network 11

0000 0000 0001 0001 0010 0010 0011 0011 0100 0100 0101 0101 0110 0110 0111 0111 1000 1000 1001 1001 1010 1010 1011 1011 1100 1100 1101 1101 1110 1110 1111 1111 16 port, 4 stage Butterfly network 12

Network Topology-Correction to Butterfly
Centralized Switched (Indirect) Networks 0000 0000 0001 0001 0010 0010 0011 0011 0100 0100 0101 0101 0110 0110 0111 0111 1000 1000 I add this slide as a correction to the previous one. I think this one is more like butterfly. --gchen on Nov.20, 2011 1001 1001 1010 1010 1011 1011 1100 1100 1101 1101 1110 1110 1111 1111 16 port, 4 stage Butterfly network 13

0000 0000 0001 0001 0010 0010 0011 0011 0100 0100 0101 0101 0110 0110 0111 0111 1000 1000 Why is it called Cube Network? Nov. 20, 2011 1001 1001 1010 1010 1011 1011 1100 1100 1101 1101 1110 1110 1111 1111 16 port, 4 stage Cube network 14

Multistage interconnection networks (MINs) MINs interconnect N input/output ports using k x k switches logkN switch stages, each with N/k switches N/k(logkN) total number of switches Example: Compute the switch and link costs of interconnecting 4096 nodes using a crossbar relative to a MIN, assuming that switch cost grows quadratically with the number of input/output ports (k). Consider the following values of k: MIN with 2 x 2 switches MIN with 4 x 4 switches MIN with 16 x 16 switches 15

Example: compute the relative switch and link costs, N = 4096 cost(crossbar)switches = 40962 cost(crossbar)links = 8192 relative_cost(2 × 2)switches = / (22 × 4096/2 × log2 4096) = 170 relative_cost(2 × 2)links = 8192 / (4096 × (log )) = 2/13 = 1)Relative cost: the larger, the better 2)For switch: the smaller, the better; For links, relative_cost(4 × 4)switches = / (42 × 4096/4 × log4 4096) = 170 relative_cost(4 × 4)links = 8192 / (4096 × (log )) = 2/7 = relative_cost(16 × 16)switches = / (162 × 4096/16 × log ) = 85 relative_cost(16 × 16)links = 8192 / (4096 × (log )) = 2/4 = 0.5 16

Relative switch and link costs for various values of k and N (crossbar relative to a MIN) Relative switch cost Relative link cost 17

From blocking to non-blocking again
Network Topology From blocking to non-blocking again 18

non-blocking topology
Network Topology Centralized Switched (Indirect) Networks Reduction in MIN switch cost comes at the price of performance Network has the property of being blocking Contention is more likely to occur on network links Paths from different sources to different destinations share one or more links 7 6 5 4 3 2 1 7 6 5 4 3 2 1 X 7 6 5 4 3 2 1 non-blocking topology blocking topology 19

How to reduce blocking in MINs? Provide alternative paths! Use larger switches (can equate to using more switches) Clos network: minimally three stages (non-blocking) A larger switch in the middle of two other switch stages provides enough alternative paths to avoid all conflicts Use more switches Add logkN - 1 stages, mirroring the original topology Rearrangeably non-blocking Allows for non-conflicting paths Doubles network hop count (distance), d Centralized control can rearrange established paths Benes topology: 2(log2N) - 1 stages (rearrangeably non-blocking) Recursively applies the three-stage Clos network concept to the middle-stage set of switches to reduce all switches to 2 x 2 20

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 port Crossbar network 21

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 We use unshuffle recursively in order to get 2logN-1 Stage Benes network which is non-blocking. Can we use butterfly instead of unshuffle in order to get another non-blocking networks? Nov. 20, 2011. 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 port, 3-stage Clos network 22

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 port, 5-stage Clos network 23

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 port, 7 stage Clos network = Benes topology 24

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 Alternative paths from 0 to port, 7 stage Clos network = Benes topology 25

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 Alternative paths from 4 to port, 7 stage Clos network = Benes topology 26

1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 Contention free, paths 0 to 1 and 4 to port, 7 stage Clos network = Benes topology 27

Bisection Bidirectional MINs Increase modularity Reduce hop count, d Fat tree network Nodes at tree leaves Switches at tree vertices Total link bandwidth is constant across all tree levels, with full bisection bandwidth Equivalent to folded Benes topology Preferred topology in many SANs 7 6 5 4 3 2 1 15 14 13 12 11 10 9 8 Folded Clos = Folded Benes = Fat tree network 28

Network Topology Myrinet-2000 Clos Network for 128 Hosts
Backplane of the M3-E128 Switch M3-SW16-8F fiber line card (8 ports) 29

Network Topology Myrinet-2000 Clos Network for 128 Hosts
“Network in a Box” 16 fiber line cards connected to the M3-E128 Switch backplane 30

Network Topology Myrinet-2000 Clos Network Extended to 512 Hosts
31

Assignment 2-2 Chose one of the following exercises:
Calculate how many permutations nxn Omega network could support. Prove that folded Clos network, folded Bens network, and Fat tree network are isomorphic to each other. Parallel Processing, Low-Diameter Architectures 2012

Indirect Networks or Dynamic Networks

Similar presentations

Presentation on theme: "Indirect Networks or Dynamic Networks"— Presentation transcript:

Similar presentations

About project

Feedback

Log in

Auth with social network:

Indirect Networks or Dynamic Networks

Similar presentations

Presentation on theme: "Indirect Networks or Dynamic Networks"— Presentation transcript:

Similar presentations

About project

Feedback