Multicast

Groups

G2

G1

G3

multicast in a group

G1

multicast in two groups

G3

G1

G1

We can have in a group: FIFO, Total order, Causal Order simply run multicast on top of broadcastto each message we attach the id of the group to which it is addressed. The multicast algorithms filters the messages (not efficient but simple)
6

Multiple-Group ordering If two processors receive the same messages, then they receive them in the same order

Total ordering of broadcast implies multiple group ordering Not an efficient solution- it employs a heavy broadcast mechanism, even if groups are small, and enforces global ordering, even if groups are disjoint

Primary destinations of groups G1

G2 G3

Message Propagation Forest: The primary destination (PM) of a group is an ancestor of all processors in G

If two groups intersect, the PM of one group in an ancestor of the PM of the other group

10

Message Propagation Forest

G1

G2 G3

11

Another example
{ p2 , p3} { p1, p2 , p3 , p4} p3 { p3 , p7 } { p3 , p4 , p5} { p4 , p5} p4 p5 p7 { p0 , p6 } p0 p2 { p0 , p1, p2 }

p1

p6
12

Multicast in { p0 , p1, p2 }
{ p2 , p3} { p1, p2 , p3 , p4} p3 { p3 , p7 } { p3 , p4 , p5} { p4 , p5} p4 p5 p7 { p0 , p6 } p0 p2 { p0 , p1, p2 }

p1

Send to primary destination

p6
13

Multicast in { p0 , p1, p2 }
{ p2 , p3} { p1, p2 , p3 , p4} p3 { p3 , p7 } { p3 , p4 , p5} { p4 , p5} p4 p5 p7 { p0 , p6 } p0 p2 { p0 , p1, p2 }

p1

Send to children in group

p6
14

Multicast in { p0 , p1, p2 } and { p1, p2 , p3 , p4} { p2 , p3} { p1, p2 , p3 , p4} p3 { p3 , p7 } { p3 , p4 , p5}

{ p4 , p5} p4 p5 p7 { p0 , p6 } p0 p2 { p0 , p1, p2 }

p1

p6
15

Multicast in { p0 , p1, p2 } and { p1, p2 , p3 , p4} { p2 , p3} { p1, p2 , p3 , p4} p3 { p3 , p7 } { p3 , p4 , p5}

{ p4 , p5} p4 p5 p7 { p0 , p6 } p0 p2 { p0 , p1, p2 }

p1

p6
16

Multicast in { p0 , p1, p2 } and { p1, p2 , p3 , p4} { p2 , p3} { p1, p2 , p3 , p4} p3 { p3 , p7 } { p3 , p4 , p5}

{ p4 , p5} p4 p5 p7 { p0 , p6 } p0 p2 { p0 , p1, p2 }

p1

Received in the same order p2 acts as filter (assumes FIFO)

17

Conclusion: Message propagation forest guarantees multiple-group ordering of multicast

18