Refer example 2.4on page 64 ACA(Kai Hwang)

87

description

Refer example 2.4on page 64 ACA(Kai Hwang) And refer another ppt attached for static scheduling example. Bisection width b = minimum number of edges cut to split a network into two parts each having the same number of nodes. Factors Affecting Network Performance. - PowerPoint PPT Presentation

Transcript of Refer example 2.4on page 64 ACA(Kai Hwang)

Page 1: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 2: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 3: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 4: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 5: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 6: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 7: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 8: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 9: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 10: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 11: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 12: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 13: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 14: Refer example 2.4on page 64 ACA(Kai Hwang)

• Refer example 2.4on page 64 ACA(Kai Hwang)

And refer another ppt attached for static scheduling example.

Page 15: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 16: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 17: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 18: Refer example 2.4on page 64 ACA(Kai Hwang)

• Bisection width b = minimum number of edges cut to split a network into two parts each having the same number of nodes.

Page 19: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 20: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 21: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 22: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 23: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 24: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 25: Refer example 2.4on page 64 ACA(Kai Hwang)

Factors Affecting Network Performance

• Functionality – how the network supports data routing, interrupt handling, synchronization, request/message combining, and coherence

• Network latency – worst-case time for a unit message to be transferred

• Bandwidth – maximum data rate• Hardware complexity – implementation costs for wire,

logic, switches, connectors, etc.• Scalability – how easily does the scheme adapt to an

increasing number of processors,memories, etc

Page 26: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 27: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 28: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 29: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 30: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 31: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 32: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 33: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 34: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 35: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 36: Refer example 2.4on page 64 ACA(Kai Hwang)

A fat tree network of 16 processing nodes.

Page 37: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 38: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 39: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 40: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 41: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 42: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 43: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 44: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 45: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 46: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 47: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 48: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 49: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 50: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 51: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 52: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 53: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 54: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 55: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 56: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 57: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 58: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 59: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 60: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 61: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 62: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 63: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 64: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 65: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 66: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 67: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 68: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 69: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 70: Refer example 2.4on page 64 ACA(Kai Hwang)

• Different classes of Multistage Interconnection Networks(MINs) differ in switch module and in the kind of interstage pattern used.

• The patterns often include perfect shuffle,butterfly,crossbar,cube connection etc

Page 71: Refer example 2.4on page 64 ACA(Kai Hwang)

Omega Network• A 2 2 switch can be configured for

– Straight-through– Crossover– Upper broadcast (upper input to both outputs)– Lower broadcast (lower input to both outputs)– (No output is a somewhat vacuous possibility as well)

• With four stages of eight 2 2 switches, and a static perfect shuffle for each of the four ISCs, a 16 by 16 Omega network can be constructed (but not all permutations are possible).

• In general , an n-input Omega network requires log 2 n stages of 2 2 switches and n / 2 switch modules.

Page 72: Refer example 2.4on page 64 ACA(Kai Hwang)

Patterns

Page 73: Refer example 2.4on page 64 ACA(Kai Hwang)

16 x 16 omega network

Page 74: Refer example 2.4on page 64 ACA(Kai Hwang)

Network Topologies: Multistage Omega Network

A complete omega network connecting eight inputs and eight outputs.

An omega network has p/2 × log p switching nodes, and the cost of such a network grows as (p log p).

A complete Omega network with the perfect shuffle interconnects and switches can now be illustrated:

Page 75: Refer example 2.4on page 64 ACA(Kai Hwang)

Network Topologies: Multistage Omega Network – Routing

An example of blocking in omega network: one of the messages (010 to 111 or 110 to 100) is blocked at link AB.

Page 76: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 77: Refer example 2.4on page 64 ACA(Kai Hwang)

Recursive Construction • The first stage contains one NXN block and second stage

contains 2 (N/2)x (N/2) sub blocks labeled Co and C1.• This construction can be recursively repeated to bub block

until 2x2 switch is reached.

Page 78: Refer example 2.4on page 64 ACA(Kai Hwang)

Baseline Network

A

C

B

D

10

2

3

4

5

6

7

10

2

3

4

5

6

7

To generalize into an n x n Baseline network, first create one stage of (n / 2) 2 x 2 switches. Then one output from each 2 x 2 switch is connected to an input of each (n / 2) x (n / 2) switch. Then the (n / 2) x (n / 2) switches are replaced by (n / 2) x (n / 2) Baseline networks constructed in the same way.

The figure to the right shows an 8 x 8 Baseline network.

J

IE

G

K

LH

F

A

C

B

D

The Baseline and Omega networks are isomorphic with each other.

Page 79: Refer example 2.4on page 64 ACA(Kai Hwang)

Isomorphism Between Baseline and Omega Networks (cont.)

If B and C, and F and G are repositioned while keeping the fixed links as the switches are moved.

A

D

10

2

3

4

5

6

7

10

2

3

4

5

6

7

IE

LH

C

B

J

KF

G

Starting with the Baseline network.

B

C

JF

KG

The Baseline network transforms into the Omega network. Therefore, the Baseline and Omega networks are isomorphic.

Page 80: Refer example 2.4on page 64 ACA(Kai Hwang)
Page 81: Refer example 2.4on page 64 ACA(Kai Hwang)

Crossbar Networks

• A crossbar network can be visualized as a single-stage switch network.

• Like a telephone switch board, the crosspoint switches provide dynamic connections between(source, destination) pairs.

• Each cross point switch can provide a dedicated connection path between a pair.

• The switch can be set on or off dynamically upon program demand.

Page 82: Refer example 2.4on page 64 ACA(Kai Hwang)

Shared Memory Crossbar

• To build a shared-memory multiprocessor, one can use a crossbar network between the processors and memory modules (Fig. 2.26a).

• The C.mmp multiprocessor has implemented a 16 x 16 crossbar network which connects 16 PDP 11 processors to 16 memory modules, each of which has a capability of 1 million words of memory cells.

Page 83: Refer example 2.4on page 64 ACA(Kai Hwang)

Shared Memory Crossbar Switch

Page 84: Refer example 2.4on page 64 ACA(Kai Hwang)

Shared Memory Crossbar Switch

• Note that each memory module can satisfy only one processor request at a time.

• When multiple requests arrive at the same memory module simaltaneously,cross bar must resolve the conflicts.

Page 85: Refer example 2.4on page 64 ACA(Kai Hwang)

Interprocess Communication Crossbar Switch

• This large crossbar was actually built in vector parallel processor.

• The PEs are the processor with attached memory.

• The CPs stand for control processor which are used to supervise entire system operation.

Page 86: Refer example 2.4on page 64 ACA(Kai Hwang)

Interprocess Communication Crossbar Switch

Page 87: Refer example 2.4on page 64 ACA(Kai Hwang)

End Of Module 5