Lecture: Interconnection Networks Topics: TM wrap-up, routing, deadlock, flow control, virtual channels 1
TM wrap-up Eager versioning: create a log of old values Handling problematic situations with a golden token Multiple commercial examples: Sun Rock, AMD ASF, IBM BG/Q, Intel Haswell Examples of deadlock, livelock, starvation 2
Network Topology Examples Grid Torus Hypercube 3
Routing Deterministic routing: given the source and destination, there exists a unique route Adaptive routing: a switch may alter the route in order to deal with unexpected events (faults, congestion) more complexity in the router vs. potentially better performance Example of deterministic routing: dimension order routing: send packet along first dimension until destination co-ord (in that dimension) is reached, then next dimension, etc. 4
Deadlock Deadlock happens when there is a cycle of resource dependencies a process holds on to a resource (A) and attempts to acquire another resource (B) A is not relinquished until B is acquired 5
Deadlock Example 4-way switch Input ports Output ports Packets of message 1 Packets of message 2 Packets of message 3 Packets of message 4 Each message is attempting to make a left turn it must acquire an output port, while still holding on to a series of input and output ports 6
Deadlock-Free Proofs Number edges and show that all routes will traverse edges in increasing (or decreasing) order therefore, it will be impossible to have cyclic dependencies Example: k-ary 2-d array with dimension routing: first route along x-dimension, then along y 17 18 19 1 2 3 2 1 0 18 1 2 3 2 1 0 17 1 2 3 2 1 0 16 1 2 3 2 1 0 7
Breaking Deadlock Consider the eight possible turns in a 2-d array (note that turns lead to cycles) By preventing just two turns, cycles can be eliminated Dimension-order routing disallows four turns Helps avoid deadlock even in adaptive routing West-First North-Last Negative-First Can allow deadlocks 8
Packets/Flits A message is broken into multiple packets (each packet has header information that allows the receiver to re-construct the original message) A packet may itself be broken into flits flits do not contain additional headers Two packets can follow different paths to the destination Flits are always ordered and follow the same path Such an architecture allows the use of a large packet size (low header overhead) and yet allows fine-grained resource allocation on a per-flit basis 9
Flow Control The routing of a message requires allocation of various resources: the channel (or link), buffers, control state Bufferless: flits are dropped if there is contention for a link, NACKs are sent back, and the original sender has to re-transmit the packet Circuit switching: a request is first sent to reserve the channels, the request may be held at an intermediate router until the channel is available (hence, not truly bufferless), ACKs are sent back, and subsequent packets/flits are routed with little effort (good for bulk transfers) 10
Channel Channel Buffered Flow Control A buffer between two channels decouples the resource allocation for each channel Packet-buffer flow control: channels and buffers are allocated per packet H B B B T Store-and-forward Cut-through 0 1 2 3 0 1 2 3 H B B B T H B B B T H B B B T Time-Space diagrams H B B B T H B B B T 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Cycle Wormhole routing: same as cut-through, but buffers in each router are allocated on a per-flit basis, not per-packet 11
Virtual Channels Buffers channel Buffers Flits do not carry headers. Once a packet starts going over a channel, another packet cannot cut in (else, the receiving buffer will confuse the flits of the two packets). If the packet is stalled, other packets can t use the channel. With virtual channels, the flit can be received into one of N buffers. This allows N packets to be in transit over a given physical channel. The packet must carry an ID to indicate its virtual channel. Buffers Buffers Physical channel Buffers Buffers 12
Example Wormhole: Node-0 A is going from Node-1 to Node-4; B is going from Node-0 to Node-5 Node-1 A Virtual channel: B idle B idle Node-2 Node-3 Node-4 Node-5 (blocked, no free VCs/buffers) Node-0 Traffic Analogy: B is trying to make a left turn; A is trying to go straight; there is no left-only lane with wormhole, but there is one with VC Node-1 A B A B A Node-2 Node-3 Node-4 Node-5 (blocked, no free VCs/buffers) 13
Virtual Channel Flow Control Incoming flits are placed in buffers For this flit to jump to the next router, it must acquire three resources: A free virtual channel on its intended hop We know that a virtual channel is free when the tail flit goes through Free buffer entries for that virtual channel This is determined with credit or on/off management A free cycle on the physical channel Competition among the packets that share a physical channel 14
Buffer Management Credit-based: keep track of the number of free buffers in the downstream node; the downstream node sends back signals to increment the count when a buffer is freed; need enough buffers to hide the round-trip latency On/Off: the upstream node sends back a signal when its buffers are close to being full reduces upstream signaling and counters, but can waste buffer space 15
Deadlock Avoidance with VCs VCs provide another way to number the links such that a route always uses ascending link numbers 17 18 19 2 1 0 18 1 2 3 2 1 0 17 1 2 3 2 1 0 16 1 2 3 2 1 0 117 118 119 102 101 100 118 117 101 102 103 Alternatively, use West-first routing on the 1 st plane and cross over to the 2 nd plane in case you need to go West again (the 2 nd plane uses North-last, for example) 116 202 201 200 217 218 218 217 201 202 203 219 216 16
Title Bullet 17