Scribd
Upload
26 views

Space-Division Switch Fabrics

Space-division switches: Multiple switching elements between input and output. E.g. Crossbar switches At the intersection of each input and each output. Staged switches: Composed of Multiple switching elements from input to output.

Uploaded by

Hiteshwar Gaur
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

Space-Division Switch Fabrics

Space-division switches: Multiple switching elements between input and output. E.g. Crossbar switches At the intersection of each input and each output. Staged switches: Composed of Multiple switching elements from input to output.

Uploaded by

Hiteshwar Gaur
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

1

Space-division switch fabrics

Copyright 2003, Tim Moors

Outline: Space-division switches


Single-stage
Crossbar, Knockout Staged switches: Multiple switching elements between input and output Networks of basic elements Clos Banyan Batcher sorting networks

Copyright 2003, Tim Moors

Crossbar switch

concentrators

At the intersection of each input and each output, there is a crosspoint, which can be selectively enabled, allowing communication from input to output. e.g. Intel 470 switches Feasible to implement in VLSI (e.g. PMC-Sierra PM9312), problem is high-speed I/O to chip - pincount
Copyright 2003, Tim Moors [Sketch from znet.net/~cdk14568/mpet/contacts/fig23-5.gif. Photos from Lucent]

Assessment of crossbar switches


Advantages: Simple structure Low latency minimal number of connecting points between arbitrary input and output. No internal blocking (may have output port blocking) Readily supports multicast Disadvantages: Complexity grows with n2, where n is the number of ports Fanout: Number of crosspoints on each line increases linearly with number of ports, increasing capacitive loading, slowing transmission No fault tolerance: each crosspoint is needed for one connection or another. Difficult to expand Output buffer speed increases in proportion to fabric, not line.
Copyright 2003, Tim Moors

Crossbar variations
Internal buffering, e.g. for variable-length packets & output contention

Design of arbiter/concentrator, e.g. Knockout switch

Picture from Keshav.

Copyright 2003, Tim Moors

Knockout switch
Crossbar with concentrators modelled on a knockout tournament: Competitors (inputs) play and those who win progress to the next round. At the end, one competitor is selected (transferred to output), and all others have lost one match. Losers then compete again (clean slate) to determine next competitor to be selected. Repeat to capacity of output port.
Copyright 2003, Tim Moors

Staged switches
Multistage switches: Composed of networks of smaller switches (e.g. crossbars and shared-media), often 2x2 Selection of switch in first and last stage is determined by which input & output are being connected ( use 3 or more stages to get benefits) There may be variety of choice of switch in intermediate stages
Lower blocking probability Increased reliability: can still connect input and output even if a component switch has fail
Copyright 2003, Tim Moors

Multistage networks: Recirculation vs spatially separate switches

Multistage switches work well as pipelines if each stage takes same time Prefer that all units of information have the same length (cells) ATM
Figure from H. Peyravi
Copyright 2003, Tim Moors

Basic 22 switching elements


Bar Interchange box Bar Gecsei 3-state cell Cross Upper broadcast Lower broadcast

Copyright 2003, Tim Moors

10

Clos switches
Multiple stages of small switches (e.g. crossbars) Each switch of a stage has one output feeding into each switch of the next stage (rectangular, not square) Fewer crosspoints, path diversity, chance of blocking
k arrays arrays nk nk N inputs
N/ n N/ n N/ n N/ n N/ n N/ n

arrays kn kn N outputs

Number of crosspoints: 2 N N x = 2 N (2 n 1) + (2n 1) n N x (min ) = 4 N 2 N 1

nk

kn

Ports Nx(3-stage Clos) 128 7,680 32768 33M

Nx(Cross) 16,356 1B

Copyright 2003, Tim Moors

11

Clos switches
Used in some commercial products: NEC ATOM ATM switch Myrinet switch Clos switches provide multiple paths; c.f. Banyan

C. Clos: A study of non-blocking switching networks, Bell Sys. Tech. J., 32(3):406-24, Mar. 1953
Copyright 2003, Tim Moors

12

Banyan switches
Self/source-routing using binary representation of output port cant multicast n-port switch has log2n stages each with n/2 22 switches Direction for each stage specified by bit corresponding to that stage (MSb 1st)
0 1

0 1

0 1

000 001 010 011 100 101 110 111 1switch to right output port of switch in this stage 0switch to left output port
Copyright 2003, Tim Moors

13

Blocking in Banyan switches


Destinations:

In the worst case, half of the traffic is blocked (when increasing input port number destined to decreasing output port number)

100 110 111 101 010 011 001 000

000 001 010 011 100 101 110 111 Output port numbers Copyright 2003, Tim Moors

14

Dealing with Banyan internal blocking


Buffering within the switching network Dilation:
Multiple planes of latter stages Move traffic blocked in one plane to higher plane (RGB)

Sorting networks

Sorter

Trap

Banyan

Copyright 2003, Tim Moors

15

Sorting networks
Sorting is essentially the same as switching, except need to spread output after sorting to account for idle ports
Input port: a Destination: 101a Sorted: 001d Switched: ---x
b c d e f g h ---b 111c 001d 010e 110f ---g 011h 010e 011h 101a 110f 111c ---x ---x 001d 010e 011h ---x 101a 110f 111c

Contention for port 101 (between inputs a & d)


Destination: 101a Sorted: 010e Switched: ---x
---b 111c 101d 010e 110f ---g 011h 011h 101a 101d 110f 111c ---x ---x --- 010e 011h ---x 101a 110f 111c 101d
Copyright 2003, Tim Moors

16

Batcher sorting networks


Simpler to sort half sets & merge, than to sort whole. Merging: Take multiple sorted lists & merge them to form a single, larger, sorted list. e.g. {1, 2, 5, 7} + {0, 3, 4, 6} {0, 1, 2, 3, 4, 5, 6, 7} Merge sort: Split items into groups. Sort each group (e.g. recursively, by using merge sort). Merge groups.

K. E. Batcher: Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference, pp. 307-14, 1968
Copyright 2003, Tim Moors

17

Sorting

Merging bitonic list

= Ascending sort = Decending sort =


1 6 2 7 8 4 5 3 6 1 2 7 8 4 3 5 bitonic list 7 7 6 3 2 6 1 4 3 2 4 5 5 1 8 8 7 3 6 4 5 2 8 1 7 8 5 7 6 6 8 5 3 4 2 3 Numerical example from 4 2 C. 1 1 Moors Partridge: Gigabit Networks Copyright 2003, Tim

18

Trap modules
Sorting alone doesnt resolve output port contention trap duplicates Starlite switch: Recirculate duplicates
Resequencing is needed. Often give priority to recirculated cells to avoid prolonged resequencing.

Conc.

Sorter

Trap

Expand

Banyan

Copyright 2003, Tim Moors

You might also like