14.5 Broadcasting on a Hypercube Flooding: applicable to any network with all-port communication 00000 Source node 00001,00010,00100,01000,10000 Neighbors of source 00011,00101,01001,10001,00110,01010,10010,01100,10100,11000 Distance2 nodes 00111,01011.10011,01101,10101,11001,01110,10110.11010.11100 Distance-3 nodes 01111410111,11011,11101,11110 Distance- 4 nodes 11111 Distance-5 node Binomial broadcast tree with single-port communication 00000 Time Fig. 14.9 l0000 The binomial 01000 l1000 broadcast tree 01100 l1100 for a 5-cube 00010 00001 2345 Fa2010 Parallel Processing, Low-Diameter Architectures Slide 16Fall 2010 Parallel Processing, Low-Diameter Architectures Slide 16 14.5 Broadcasting on a Hypercube Flooding: applicable to any network with all-port communication 00000 Source node 00001, 00010, 00100, 01000, 10000 Neighbors of source 00011, 00101, 01001, 10001, 00110, 01010, 10010, 01100, 10100, 11000 Distance-2 nodes 00111, 01011, 10011, 01101, 10101, 11001, 01110, 10110, 11010, 11100 Distance-3 nodes 01111, 10111, 11011, 11101, 11110 Distance-4 nodes 11111 Distance-5 node Binomial broadcast tree with single-port communication 0 1 2 3 4 5 Time 00000 10000 01000 11000 00100 01100 10100 11100 00001 00010 Fig. 14.9 The binomial broadcast tree for a 5-cube