Examples

1
Examples

• Broadcasting and Gossiping

2
Broadcast on ring (Safe and Forward)
3
Broadcast on mesh (Safe and Forward)
4
Hypercube

• Important properties of the networks
• Small degree,
• Small diameter,
• Regular recursive structure,
• Easy way to embed trees, etc
• Hypercube two nodes connected if they are
  differ precisely on one bit

5
Hypercube two nodes connected if they are
differ precisely on one bit
6
(No Transcript)
7
(No Transcript)
8
Broadcast on hypercube (SF)
9
(No Transcript)
10
Broadcast on ring (Cut-Through )
11
Broadcast on mesh (C-T)
12
Broadcast on binary tree (C-T)
13
Gossiping
All-to-All Communication
14
Gossiping on Ring (Store and Forward)
15
Gossiping on Mesh (Store and Forward)
16
Gossiping on Hypercube (SF)
17
Gossiping on Ring (and Mesh)Cut-Through Routing

• Each process sends m(p-1) words of data because
  it has an m-word packet for every other processor
• The average distance that an m word packet
  travels is
• Since there are p processors, each performing the
  same type of communication, the total traffic on
  the network is
• The total number of communication channels in the
  network to share this load is p.

Hence this procedure cannot be improved by using
CT routing
18
Gossiping on Hypercube (CT routing)